A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm

DOI10.1137/0726036zbMath0723.65039OpenAlexW2013261078MaRDI QIDQ3210782

Jon W. Tolle, Paul T. Boggs

Publication date: 1989

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0726036

zbMATH Keywords

global convergencesequential quadratic programmingnonlinear programmingeffectivenessmerit functionNumerical results

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

On combining feasibility, descent and superlinear convergence in inequality constrained optimization ⋮ An efficient feasible SQP algorithm for inequality constrained optimization ⋮ A cautious BFGS update for reduced Hessian SQP ⋮ A practical optimality condition without constraint qualifications for nonlinear programming ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ A reduced Hessian SQP method for inequality constrained optimization ⋮ A practical update criterion for SQP method ⋮ Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints