Algorithm of exponential-type exact penalty function for nonlinear inequality constrained optimization

Expand
  • College of Sciences, Shanghai University, Shanghai 200444, China

Received date: 2016-02-22

  Online published: 2017-12-30

Abstract

To deal with nonlinear inequality constrained optimization problems, we construct a new exponential-type penalty function by adding a variable, and prove smoothness and accuracy of the penalty function. In addition, an exact penalty function algorithm is proposed to solve nonlinear inequality constrained optimization problems. Numerical results are reported to show effectiveness of the algorithm.

Cite this article

YANG Lian, YAO Yirong . Algorithm of exponential-type exact penalty function for nonlinear inequality constrained optimization[J]. Journal of Shanghai University, 2017 , 23(6) : 911 . DOI: 10.12066/j.issn.1007-2861.1769

References

[1] Courant R. Variational methods for the solution of problems of equilibrium and vibrations [J]. Bulletin of the American Mathematical Society, 1943, 49: 1-23.

[2] Carroll C W, Fiacco A V. The created response surface technique for optimizing nonlinear restrained systems [J]. Operations Research, 1961, 9(2): 169-184.

[3] Eremin I I. The penalty method in convex programming [J]. Cybernetics and Systems Analysis, 1967, 3(4): 53-56.

[4] Zangwill W I. Nonlinear programming via penalty function [J]. Management Science, 1967, 13(5): 344-358.

[5] Antczak T. Exact penalty function method for mathematical programming problem involving invex function [J]. European Journal of Operational Research, 2009, 198(1): 29-36.

[6] Zaslavski A J. Existence of exact penalty for constrained optimization problems in Metric spaces [J]. Set-Valued Analysis, 2007, 15(3): 223-237.

[7] Zheng F Y, Zhang L S. New simple exact penalty function for constrained minimization [J]. Applied Mathematics and Mechanics (English Edition), 2012, 33(7): 951-962.

[8] Roseberg E. Globally convergent algorithms for convex programming with applications to geometric programming [J]. Mathematics of Operations Research, 1981, 6(3): 437-443.

[9] Lasserre J B. A globally convergent algorithm for exact penalty functions [J]. European Journal of Operational, 1981, 7(4): 389-395.

[10] Pinar M C, Zenios S A. On smoothing exact penalty functions for convex constrained optimization[J]. SIAM Journal on Optimization, 1994, 4(3): 486-511.

[11] K¨omer F. On the numerical realization of the exact penalty method for quadratic programming algorithm [J]. European Journal of Operational Research, 1990, 46(3): 404-409.

[12] 张连生.全局精确罚函数的一个充要条件[J]. 数学年刊(A ), 1997, 18(5):579-586.

[13] Lucidi S. New results on a continuously differentiable exact penalty function [J]. SIAM Journal on Optimization, 1992, 2(4): 558-574.

[14] Li W, Peng J. Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities [J]. Journal of Global Optimization, 2007, 37(1): 85-94.

[15] Meng Z Q, Dang C Y, Jiang M, et al. Exactness and algorithm of an objective penalty function[J]. Journal of Global Optimization, 2013, 56(2): 691-711.

[16] Huyer W, Neumaier A. A new exact penalty function [J]. SIAM Journal on Optimization, 2003, 13(4): 1141-1158.

Outlines

/