๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A feasible and superlinear algorithm for inequality constrained minimization problems

โœ Scribed by Xu Yifan; Wang Wei

Book ID
110611753
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2000
Tongue
English
Weight
286 KB
Volume
16
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

FEASIBLE DESCENT CONE METHODS FOR INEQUA
FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS
โœ J. A. SNYMAN; N. STANDER ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 784 KB

A new Feasible Descent Cone (FDC) method for constrained optimization, previously restricted to linear objectives, is here generalized to include non-linear objective functions as well. In the basic and exact algorithm a sequence of descent steps is taken through the interior of the feasible region

A simple feasible SQP method for inequal
A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
โœ Zhong Jin; Yuqing Wang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 750 KB

In this paper, a simple feasible SQP method for nonlinear inequality constrained optimization is presented. At each iteration, we need to solve one QP subproblem only. After solving a system of linear equations, a new feasible descent direction is designed. The Maratos effect is avoided by using a h