A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.

DOI10.1023/A:1011983130559zbMath1068.90615OpenAlexW159872844MaRDI QIDQ5954201

Liqun Qi, Yu-Fei Yang

Publication date: 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011983130559

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (6)

Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model ⋮ Sequential penalty algorithm for nonlinear constrained optimization ⋮ A trust region SQP-filter method for nonlinear second-order cone programming ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ An improved sequential quadratic programming algorithm for solving general nonlinear programming problems ⋮ Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation

Uses Software

• GQTPAR

This page was built for publication: A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.