Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A new successive quadratic programming algorithm

A new successive quadratic programming algorithm The main difficulties encountered in the successive quadratic programming methods are the choice of penalty parameter, the choice of steplenth, and the Maratos effect. An algorithm without penalty parameters is presented in this paper. The choice of steplength parameters is based on the method of trust region. Global convergence and local superlinear convergence are proved under suitable assumption. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A new successive quadratic programming algorithm

Acta Mathematicae Applicatae Sinica , Volume 8 (3) – Jul 15, 2005

Loading next page...
 
/lp/springer-journals/a-new-successive-quadratic-programming-algorithm-aT8FIUX80t

References (19)

Publisher
Springer Journals
Copyright
Copyright © 1992 by Science Press
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02014586
Publisher site
See Article on Publisher Site

Abstract

The main difficulties encountered in the successive quadratic programming methods are the choice of penalty parameter, the choice of steplenth, and the Maratos effect. An algorithm without penalty parameters is presented in this paper. The choice of steplength parameters is based on the method of trust region. Global convergence and local superlinear convergence are proved under suitable assumption.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 15, 2005

There are no references for this article.