The aggregate constraint homotopy method for nonconvex nonlinear programming

DOI10.1016/S0362-546X(99)00420-4zbMath1002.90092OpenAlexW2063697138WikidataQ127846823 ScholiaQ127846823MaRDI QIDQ5946387

Bo Yu, Shao-Liang Zhang, Guo-Chen Feng

Publication date: 12 January 2003

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0362-546x(99)00420-4

zbMATH Keywords

homotopy method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items

Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ A combined homotopy interior point method for the linear complementarity problem ⋮ An aggregate deformation homotopy method for min-max-min problems with max-min constraints ⋮ A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints ⋮ Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming ⋮ A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ A homotopy method for nonlinear second-order cone programming ⋮ Truncated aggregate homotopy method for nonconvex nonlinear programming ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method ⋮ A spline smoothing homotopy method for nonconvex nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On some efficient interior point methods for nonlinear convex programming
• An aggregate function method for nonlinear programming
• A combined homotopy interior point method for convex nonlinear programming
• Homotopy method for a class of nonconvex Brouwer fixed-point problems
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• The Projective SUMT Method for Convex Programming
• An Aggregate Constraint Method for Non-Linear Programming
• A path following algorithm for a class of convex programming problems
• Path-Following Methods for Linear Programming
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem