An improved feasible QP-free algorithm for inequality constrained optimization
From MaRDI portal
Publication:1941312
DOI10.1007/s10114-012-0561-xzbMath1287.90073OpenAlexW2134341940MaRDI QIDQ1941312
Publication date: 12 March 2013
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-012-0561-x
global convergenceinequality constrained optimizationsystem of linear equationssuperlinear convergence ratefeasible QP-free method
Related Items (3)
A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- Test examples for nonlinear programming codes
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A sequential quadratic programming method for potentially infeasible mathematical programs
- A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A two-stage feasible directions algorithm for nonlinear 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
- 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
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
This page was built for publication: An improved feasible QP-free algorithm for inequality constrained optimization
