Line search SQP method with a flexible step acceptance procedure

DOI10.1016/J.APNUM.2015.01.009MaRDI QIDQ491490zbMATH OpenOpenAlexFDO

Authors Mingxia Huang, Dingguo Pu

Publication date 26 August 2015

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apnum.2015.01.009

zbMATH Keywords

nonlinear programmingalgorithmglobal convergencenumerical resultfilterinequality constraintsline searchmerit functionquadratic programming subproblemsuccessive quadratic programming (SQP)

Mathematics Subject Classification ID

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

Recommendations

• Sequential quadratic programming with a flexible step acceptance strategy
• A line search SQP method without a penalty or a filter
• A feasible SQP method for nonlinear programming
• scientific article; zbMATH DE number 1919456
• An SQP method with a revised non-monotone line search

Cited in

(2)

• A new filter QP-free method for the nonlinear inequality constrained optimization problem
• Sequential quadratic programming with a flexible step acceptance strategy

Describes a project that uses

Uses Software

• ipfilter
• AMPL
• SNOPT

This page was built for publication: Line search SQP method with a flexible step acceptance procedure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491490)