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

DOI10.1016/J.APM.2011.07.043MaRDI QIDQ437832zbMATHOpenAlexFDO

Authors Qingjie Hu, Zi-Sheng Ouyang, Yu Chen

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)

Recommendations

• An improved feasible QP-free algorithm for inequality constrained optimization
• An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
• A new type feasible QP-free algorithm for inequality constrained optimization
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
• A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization

Cites work

• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
• Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
• 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
• Test example for nonlinear programming codes
• Test examples for nonlinear programming codes

Cited in

(7)

• An improved feasible QP-free algorithm for inequality constrained optimization
• A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
• A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
• An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
• A new type feasible QP-free algorithm for inequality constrained optimization
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q437832)