DocumentCode
3062185
Title
New Form of Lagrangian Multiplier Methods
Author
Aifen Feng ; Cuixia Xu ; Dingguo Pu
Author_Institution
Dept. of Math., Henan Univ. of Sci. & Technol., Luoyang, China
fYear
2012
fDate
23-26 June 2012
Firstpage
302
Lastpage
306
Abstract
The Lagrangian multiplier method is one of the important methods of solving nonlinear constraints programming. In this paper, a new class of augmented Lagrangian functions with a new NCP function is proposed for the minimization of a smooth function subject to smooth equation and inequality constraints. Under certain conditions, We prove 1-1 corresponding relationship of optimality solution between the primal constrained problem and the new unconstrained problem. Then a Algorithm is constructed to solve nonlinear constraints problem, and also prove the convergence of the algorithm.
Keywords
constraint handling; nonlinear programming; 1-1 corresponding relationship; Lagrangian multiplier methods; NCP function; augmented Lagrangian functions; inequality constraints; minimization; nonlinear constraints problem; nonlinear constraints programming; optimality solution; primal constrained problem; smooth equation; smooth function; unconstrained problem; Convergence; Educational institutions; Equations; Lagrangian functions; Minimization; Optimization; Vectors; K-K-T point; Lagrangian multiplier; constrained optimization; nonlinear complementarity function;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Sciences and Optimization (CSO), 2012 Fifth International Joint Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4673-1365-0
Type
conf
DOI
10.1109/CSO.2012.74
Filename
6274732
Link To Document