A superlinearly convergent numerical algorithm for nonlinear programming
From MaRDI portal
Publication:1926210
DOI10.1016/j.nonrwa.2012.02.005zbMath1281.90063MaRDI QIDQ1926210
Publication date: 28 December 2012
Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.nonrwa.2012.02.005
global convergence; inequality constrained optimization; QP-free algorithm; SQP algorithm; superlinear convergence rate
Related Items
A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization, Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase
Cites Work
- Unnamed Item
- Test example for nonlinear programming codes
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- An improved SQP algorithm for inequality constrained optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A surperlinearly convergent algorithm for constrained optimization problems
- 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
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
