A Global Convergent Line Search Filter SQP Method

doi:10.3969/j.issn.0253374x.2011.06.023

Home > Archive>Volume 39, Issue 6, 2011 >914-918. DOI:10.3969/j.issn.0253374x.2011.06.023

A Global Convergent Line Search Filter SQP Method
DOI:
                        10.3969/j.issn.0253374x.2011.06.023
                    
CSTR:
                        [cstr]
                    
Author:
                        
                        
                    
Affiliation:
Clc Number:O 221.2
Fund Project:

Article

Figures

Metrics

Reference

Cited by

Materials

Comments

Abstract:

The paper presents a line search filter sequential quadratic programming(SQP) method for inequality constrained optimization.Compared to traditional SQP methods,the advantages are that the quadratic programming (QP) subproblem is always consistent and the penalty function is not required by filter strategy.Under some mild conditions the global convergence can be induced.

Reference

Cited by

Get Citation

JIN Zhong, WANG Yuqing. A Global Convergent Line Search Filter SQP Method[J].同济大学学报(自然科学版),2011,39(6):914~918

Copy

Article Metrics

Abstract:
PDF:
HTML:
Cited by:

History

Received:March 01,2010
Revised:September 13,2010
Adopted:December 03,2010
Online: July 06,2011
Published:

Get Citation

Share

Article Metrics

History

Article QR Code