A constraint shifting homotopy method for general non-linear programming

DOI10.1080/02331934.2012.668189zbMath1291.49024OpenAlexW2016018119MaRDI QIDQ5169444

Bo Yu, Li Yang, Qing Xu

Publication date: 10 July 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.668189

zbMATH Keywords

global convergencehomotopy methodnonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on necessary conditions (49M05) Numerical methods based on nonlinear programming (49M37)

Related Items (6)

Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ Globally convergent homotopy method for designing piecewise linear deterministic contractual function ⋮ Unnamed Item ⋮ A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming ⋮ Globally convergent method for designing twice spline contractual function

Cites Work

• Unnamed Item
• Unnamed Item
• A homotopy method for getting a local minimum of constrained nonconvex programming
• On the complexity of a combined homotopy interior method for convex programming
• A globally convergent interior point algorithm for non-convex nonlinear programming
• A combined homotopy interior point method for general nonlinear programming problems
• A combined homotopy interior point method for convex nonlinear programming
• Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
• Algorithm 652
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• Introduction to Numerical Continuation Methods

This page was built for publication: A constraint shifting homotopy method for general non-linear programming