An infeasible active-set QP-free algorithm for general nonlinear programming

DOI10.1080/00207160.2016.1154947MaRDI QIDQ4976293zbMATHOpenAlexFDO

Authors Hua Wang, Fuyao Liu, Chao Gu, 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

zbMATH Keywords

global convergencefiltersuperlinear convergenceactive setQP-free methodgeneral nonlinear programming

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

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

Cites work

• A Feasible Active Set QP-Free Method for Nonlinear Programming
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
• A filter algorithm for nonlinear systems of equalities and inequalities
• A globally and superlinearly convergent feasible QP-free method for nonlinear programming
• A globally and superlinearly convergent modified SQP-filter method
• A line search filter algorithm with inexact step computations for equality constrained optimization
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• A robust sequential quadratic programming method
• A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
• A surperlinearly convergent algorithm for constrained optimization problems
• A trust region filter method for general non-linear programming
• An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
• An improved feasible QP-free algorithm for inequality constrained optimization
• An infeasible nonmonotone SSLE algorithm for nonlinear programming
• Exact penalty function algorithm with simple updating of the penalty parameter
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
• Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
• Nonlinear programming without a penalty function.
• On the Accurate Identification of Active Constraints
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints

Cited in

(4)

• An infeasible nonmonotone SSLE algorithm for nonlinear programming
• An accelerating algorithm for globally solving nonconvex quadratic programming
• A Feasible Active Set QP-Free Method for Nonlinear Programming
• A fast MPC algorithm using nonfeasible active set methods

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)