A modified QP-free feasible method
From MaRDI portal
Publication:552398
DOI10.1016/j.apm.2010.10.002zbMath1217.90150OpenAlexW2047928508MaRDI QIDQ552398
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
global convergenceconstrained optimizationfiltersuperlinear convergenceNCP functionQP-free algorithm
Related Items (1)
Cites Work
- Unnamed Item
- Test examples for nonlinear programming codes
- An improved SQP algorithm for inequality constrained optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A trust region filter method for general non-linear programming
- 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 note on quasi-newton formulae for sparse second derivative matrices
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- 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.
This page was built for publication: A modified QP-free feasible method