A feasible interior-point algorithm for nonconvex nonlinear programming

DOI10.1016/j.amc.2003.10.059zbMath1069.65066OpenAlexW2104467317MaRDI QIDQ1774879

Zhi Bin Zhu

Publication date: 4 May 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.10.059

zbMATH Keywords

AlgorithmNonlinear programmingGlobal convergenceInterior-point method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items

Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set

Uses Software

• TRICE

Cites Work

• Unnamed Item
• A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
• A new polynomial-time algorithm for linear programming
• Test examples for nonlinear programming codes
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• The Projective SUMT Method for Convex Programming
• Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the rate of convergence of certain methods of centers

This page was built for publication: A feasible interior-point algorithm for nonconvex nonlinear programming