A feasible interior-point algorithm for nonconvex nonlinear programming

DOI10.1016/J.AMC.2003.10.059MaRDI QIDQ1774879zbMATH OpenOpenAlexFDO

Authors Zhibin 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

AlgorithmGlobal convergenceInterior-point methodNonlinear programming

Mathematics Subject Classification ID

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

Recommendations

• An interior-point algorithm for nonconvex nonlinear programming
• A globally convergent interior point algorithm for non-convex nonlinear programming
• A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
• Interior‐point method for non‐linear non‐convex optimization
• On some efficient interior point methods for nonlinear convex programming

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• A computationally efficient feasible sequential quadratic programming algorithm
• A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
• A new polynomial-time algorithm for linear programming
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the rate of convergence of certain methods of centers
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Test examples for nonlinear programming codes
• The Projective SUMT Method for Convex Programming
• Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems

Cited in

(9)

• Theoretical justification of interior point algorithms for solving optimization problems with nonlinear constraints
• On some efficient interior point methods for nonlinear convex programming
• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
• Interior‐point method for non‐linear non‐convex optimization
• An interior-point based subgradient method for nondifferentiable convex optimization
• Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
• A feasible BFGS interior point algorithm for solving convex minimization problems
• scientific article; zbMATH DE number 1150096 (Why is no real title available?)
• A globally convergent interior point algorithm for non-convex nonlinear programming

Describes a project that uses

Uses Software

• TRICE

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

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