A modified QP-free feasible method

DOI10.1016/J.APM.2010.10.002MaRDI QIDQ552398zbMATH OpenOpenAlexFDO

Authors Hua Wang, Dingguo Pu

Publication date 21 July 2011

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2010.10.002

zbMATH Keywords

constrained optimizationglobal convergencefiltersuperlinear convergenceNCP functionQP-free algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 5257227
• A filter QP-free method with piecewise linear NCP function
• Filter QP-free method with 3-piecewise linear NCP function
• scientific article; zbMATH DE number 2112990
• A new QP-free method without a penalty function and a filter

Cites work

• scientific article; zbMATH DE number 3643051 (Why is no real title available?)
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• A note on quasi-newton formulae for sparse second derivative matrices
• A trust region filter method for general non-linear programming
• An improved SQP algorithm for inequality constrained optimization
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Nonlinear programming without a penalty function.
• On the Global Convergence of a Filter--SQP Algorithm
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Test examples for nonlinear programming codes

Cited in

(3)

• scientific article; zbMATH DE number 5669751 (Why is no real title available?)
• Sequential quadratic programming with a flexible step acceptance strategy
• A QP-free feasible method with slack NCP function

This page was built for publication: A modified QP-free feasible method

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