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

DOI10.1080/00207160.2016.1154947zbMath1386.90153OpenAlexW2332674837MaRDI QIDQ4976293

Chao Gu, Hua Wang, Fuyao Liu, Pu, Dingguo

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

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

Related Items (1)

An accelerating algorithm for globally solving nonconvex quadratic programming

Cites Work

• A filter algorithm for nonlinear systems of equalities and inequalities
• 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 line search filter algorithm with inexact step computations for equality constrained optimization
• A globally and superlinearly convergent modified SQP-filter method
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
• An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
• A robust sequential quadratic programming method
• 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
• An infeasible nonmonotone SSLE algorithm for nonlinear programming
• A trust region filter method for general non-linear programming
• A globally and superlinearly convergent feasible QP-free method for nonlinear programming
• A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
• A Feasible Active Set QP-Free Method for Nonlinear Programming
• 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
• On the Accurate Identification of Active Constraints
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
• Nonlinear programming without a penalty function.

This page was built for publication: An infeasible active-set QP-free algorithm for general nonlinear programming