A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints

DOI10.1007/s00186-023-00845-wOpenAlexW4389849323MaRDI QIDQ6182689

Li Dong, Li Yang, Zhengyong Zhou

Publication date: 25 January 2024

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-023-00845-w

zbMATH Keywords

global convergencehomotopy methodnonlinear programmingspline function

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Uniform approximation of min/max functions by smooth splines
• An interior-point algorithm for nonconvex nonlinear programming
• A combined homotopy interior point method for general nonlinear programming problems
• A combined homotopy interior point method for convex nonlinear programming
• A smoothing Newton method for semi-infinite programming
• Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
• A spline smoothing homotopy method for nonconvex nonlinear programming
• Algorithm 652
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• A constraint shifting homotopy method for general non-linear programming
• CUTEr and SifDec
• The aggregate constraint homotopy method for nonconvex nonlinear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item