An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
From MaRDI portal
Publication:2342895
DOI10.1007/s40314-013-0109-4zbMath1342.90187OpenAlexW2077961923MaRDI QIDQ2342895
Feng Kong, Weiai Liu, Pu, Dingguo
Publication date: 29 April 2015
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-013-0109-4
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- Global convergence of a robust filter SQP algorithm
- Test examples for nonlinear programming codes
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
- Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Strongly Regular Generalized Equations
- On the Accurate Identification of Active Constraints
- Numerical Optimization
- Trust Region Methods
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Global and local convergence of a filter line search method for nonlinear programming
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
