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

DOI10.1016/j.apm.2006.04.019zbMath1211.90289OpenAlexW2015893830MaRDI QIDQ938022

Zhi Bin 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 convergencesuperlinear convergenceinequality constrained optimizationsystem of linear equationsinterior point

Mathematics Subject Classification ID

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

Related Items (9)

A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ An infeasible nonmonotone SSLE algorithm for nonlinear programming ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ An improved feasible QP-free algorithm for inequality constrained optimization ⋮ An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization

Cites Work

• Unnamed Item
• Test examples for nonlinear programming codes
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• An efficient sequential quadratic programming algorithm for nonlinear programming
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• 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
• 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
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems

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