A spline smoothing homotopy method for nonconvex nonlinear programming

DOI10.1080/02331934.2015.1064122zbMath1338.90387OpenAlexW2277563817MaRDI QIDQ2810089

Bo Yu, Li Dong, Guohui Zhao

Publication date: 31 May 2016

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

interior-point methodhomotopy methodnonlinear programmingspline function

Mathematics Subject Classification ID

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

Related Items

A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints, A spline smoothing Newton method for finite minimax problems, A spline smoothing Newton method for semi-infinite minimax problems

Cites Work

• Uniform approximation of min/max functions by smooth splines
• On some efficient interior point methods for nonlinear convex programming
• A combined homotopy interior point method for convex nonlinear programming
• A smoothing Newton method for semi-infinite programming
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• A path following algorithm for a class of convex programming problems
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
• The aggregate constraint homotopy method for nonconvex nonlinear programming