Primal-dual interior point QP-free algorithm for nonlinear constrained optimization

DOI10.1186/s13660-017-1500-2zbMath1380.90255OpenAlexW2760662288WikidataQ42367907 ScholiaQ42367907MaRDI QIDQ2407660

Guodong Ma, Hanjun Zeng, Zhi Bin Zhu, Jin-Bao Jian

Publication date: 6 October 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-017-1500-2

zbMATH Keywords

optimizationglobal and superlinear convergenceworking setinequality and equality constraintsprimal-dual interior method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

A global QP-free algorithm for mathematical programs with complementarity constraints

Uses Software

• SNOPT

Cites Work

• Unnamed Item
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
• Smoothing of the lower-order exact penalty function for inequality constrained optimization
• New active set identification for general constrained optimization and minimax problems
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
• An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
• Test examples for nonlinear programming codes
• Feasible direction interior-point technique for nonlinear optimization
• An SQP method for general nonlinear programs using only equality constrained subproblems
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• Failure of global convergence for a class of interior point methods for nonlinear programming
• A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• A Feasible Active Set QP-Free Method for Nonlinear Programming
• 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
• Feasible directions algorithms for optimization problems with equality and inequality constraints
• On the Accurate Identification of Active Constraints
• 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
• Interior Methods for Nonlinear Optimization
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

This page was built for publication: Primal-dual interior point QP-free algorithm for nonlinear constrained optimization