By Topic

A Feasible SQP Method Using Augmented Lagrangian Function for General Constrained Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaowei Jiang ; Sch. of Math. & Inst. of Appl. Math., Beihua Univ., Jilin, China ; Yueting Yang ; Yunlong Lu

An feasible SQP method is proposed to solve general optimization problems with equality and inequality constraints. First, we transform the original problem to an associated simpler problem with only inequality constraints, and the simplified problem is shown to be equivalent to the original problem under the mild condition. Then we use feasible SQP method to solve the latter problem. Here, we use the augmented Lagrangian function to be objective function. At each iteration, multiplier and penalty parameter are updated by the simpler criterion. Numerical experiments are implemented to test the efficiency of the proposed method.

Published in:

Computational Sciences and Optimization (CSO), 2012 Fifth International Joint Conference on

Date of Conference:

23-26 June 2012