An infeasible active-set QP-free algorithm for general nonlinear programming
DOI10.1080/00207160.2016.1154947zbMATH Open1386.90153OpenAlexW2332674837MaRDI QIDQ4976293FDOQ4976293
Chao Gu, Hua Wang, Fuyao Liu, Dingguo Pu
Publication date: 28 July 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1154947
Recommendations
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
global convergencefiltersuperlinear convergenceactive setQP-free methodgeneral nonlinear programming
Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- On the Accurate Identification of Active Constraints
- Nonlinear programming without a penalty function.
- 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
- An improved feasible QP-free algorithm for inequality constrained optimization
- Exact penalty function algorithm with simple updating of the penalty parameter
- 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 surperlinearly convergent algorithm for constrained optimization problems
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- A trust region filter method for general non-linear programming
- A globally and superlinearly convergent modified SQP-filter method
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A robust sequential quadratic programming method
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- A filter algorithm for nonlinear systems of equalities and inequalities
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- A line search filter algorithm with inexact step computations for equality constrained optimization
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
Cited In (2)
This page was built for publication: An infeasible active-set QP-free algorithm for general nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976293)
