A modified QP-free feasible method
From MaRDI portal
Publication:552398
DOI10.1016/J.APM.2010.10.002zbMATH Open1217.90150OpenAlexW2047928508MaRDI QIDQ552398FDOQ552398
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
Recommendations
constrained optimizationglobal convergencefiltersuperlinear convergenceNCP functionQP-free algorithm
Cites Work
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- On the Global Convergence of a Filter--SQP Algorithm
- Nonlinear programming without a penalty function.
- Test examples for nonlinear programming codes
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A trust region filter method for general non-linear programming
- Title not available (Why is that?)
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- A note on quasi-newton formulae for sparse second derivative matrices
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- An improved SQP algorithm for inequality constrained optimization
Cited In (3)
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)