An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems

DOI10.1016/j.apm.2011.07.043zbMath1243.90245OpenAlexW2014829713MaRDI QIDQ437832

Yu Chen, Zi-Sheng Ouyang, Qing-Jie Hu

Publication date: 20 July 2012

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.07.043

zbMATH Keywords

global convergencesuperlinear convergenceinequality constrained optimizationinterior-type QP-free algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Cites Work

• Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
• 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
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
• Test example 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 New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
• 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
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization

This page was built for publication: An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems