Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Burke, Shih-Ping Han (1989)
A robust sequential quadratic programming methodMathematical Programming, 43
M.J.D. Powell, Y. Yuan (1986)
A Recursive Quadratic Programming Algorithm for Equality Constrained OptimizationMathematical Programming, 35
M. Fukushima (1986)
A successive quadratic programming algorithm with global and superlinear convergence propertiesMathematical Programming, 35
M. Powell (1982)
Variable Metric Methods for Constrained Optimization
R. Fletcher (1982)
Second Order Correction for Nondifferentiable Optimization
Ya-xiang Yuan (1985)
An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximationsMathematical Programming, 32
Hiroshi Yamashita (1982)
A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty functionMathematical Programming, 23
J. Moré, D. Sorensen (1979)
On the use of directions of negative curvature in a modified newton methodMathematical Programming, 16
Jianzhong Zhang (1987)
SQP Methods for Constrained Extremum ProblemsApplied Mathematic A Journal of Chinese Universities, 2
M. Sahba (1987)
Globally Convergent Algorithm for Nonlinear Constrained OptimizationJournal Optimization Theory and Applications, 52
M. Sahba (1987)
Globally convergent algorithm for nonlinearly constrained optimization problemsJournal of Optimization Theory and Applications, 52
G. He (1990)
A NEW VARIABLE METRIC METHOD FOR CONSTRAINED OPTIMIZATION
M.J.D. Powell (1983)
Mathematical Programming: The State of the Art, Bonn, 1982
袁亚湘 (1990)
Nonlinear Programming——a Review, 19
G. Pillo, L. Grippo (1986)
An exact penalty function method with global convergence properties for nonlinear programming problemsMathematical Programming, 36
M. Powell, Ya-xiang Yuan (1986)
A recursive quadratic programming algorithm that uses differentiable exact penalty functionsMathematical Programming, 35
P. Boggs, J. Tolle (1984)
A family of descent functions for constrained optimizationSIAM Journal on Numerical Analysis, 21
Shih-Ping Han (1975)
A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 22
R. Chamberlain, M. Powell, C. Lemaréchal, H. Pedersen (1982)
The watchdog technique for forcing convergence in algorithms for constrained optimization
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.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 15, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.