An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization

DOI10.1016/J.APM.2006.04.019MaRDI QIDQ938022zbMATH OpenOpenAlexFDO

Authors Zhibin Zhu

Publication date 18 August 2008

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

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

zbMATH Keywords

global convergenceinterior pointsuperlinear convergencesystem of linear equationsinequality constrained optimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Interior-point methods (90C51)

Recommendations

• An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
• A superlinearly convergent feasible interior point algorithm for inequality constrained optimization
• A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
• An improved feasible QP-free algorithm for inequality constrained optimization

Cites work

• scientific article; zbMATH DE number 3583207 (Why is no real title available?)
• 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 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 successive quadratic programming algorithm with global and superlinear convergence properties
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• An efficient sequential quadratic programming algorithm for nonlinear programming
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• 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
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Test examples for nonlinear programming codes

Cited in

(13)

• An infeasible nonmonotone SSLE algorithm for nonlinear programming
• An improved feasible QP-free algorithm for inequality constrained optimization
• An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
• A superlinearly convergent feasible interior point algorithm for inequality constrained optimization
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
• A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
• A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
• A globally convergent QP-free algorithm for inequality constrained minimax optimization
• A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
• 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization

This page was built for publication: An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization

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