𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sequential equality constrained quadratic programming algorithm for inequality constrained optimization

✍ Scribed by Zhibin Zhu

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
200 KB
Volume
212
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Indefinitely preconditioned conjugate gr
Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
✍ C. Durazzi; V. Ruggiero πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

## Abstract This paper is concerned with the numerical solution of a symmetric indefinite system which is a generalization of the Karush–Kuhn–Tucker system. Following the recent approach of LukΕ‘an and Vlček, we propose to solve this system by a preconditioned conjugate gradient (PCG) algorithm and