✦ LIBER ✦

A SQP Method for Inequality Constrained Optimization

✍ Scribed by Ju-liang Zhang; Xiang-sun Zhang

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2002
Tongue: English
Weight: 135 KB
Volume: 18
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s102550200005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An improved SQP algorithm for inequality

An improved SQP algorithm for inequality constrained optimization

✍ Zhibin Zhu; Kecun Zhang; Jinbao Jian 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 273 KB

An efficient feasible SQP algorithm for

An efficient feasible SQP algorithm for inequality constrained optimization

✍ Zhibin Zhu; Jinbao Jian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 454 KB

In this paper, an efficient feasible SQP method is proposed to solve nonlinear inequality constrained optimization problems. Here, a new modified method is presented to obtain the revised feasible descent direction. Per single iteration, it is only necessary to solve one QP subproblem and a system o

-factor methods for nonregular inequalit

-factor methods for nonregular inequality-constrained optimization problems

✍ Ewa Szczepanik; Alexey Tret’yakov 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 547 KB

The paper presents a new method for solving irregular optimization problems with inequality constraints. Our results are based on the construction of p-regularity theory and on reformulating the inequality constraints as equalities. Namely, by introducing the slack variables of corresponding degree

Using the KKT matrix in an augmented Lag

Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization

✍ M. C. Bartholomew-Biggs; M. De F. G. Hernandez 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 994 KB

A new computational method for the funct

A new computational method for the functional inequality constrained minimax optimization problem

✍ D.C. Jiang; K.L. Teo; W.Y. Yan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 715 KB

In this paper, we consider a general class of functional inequality constrained minimax optimization problems. This problem is first converted into a semi-infinite programming problem. Then, an auxiliary cost function is constructed based on a positive saturated function. The smallest zero of this a