A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems

DOI10.1155/2020/5483587zbMath1480.90233OpenAlexW3039642368MaRDI QIDQ2246543

Yanyan Li

Publication date: 16 November 2021

Published in: Advances in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/5483587

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An aggregate function method for nonlinear programming
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
• Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
• An Aggregate Constraint Method for Non-Linear Programming
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• Introduction to Numerical Continuation Methods
• The aggregate constraint homotopy method for nonconvex nonlinear programming

This page was built for publication: A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems