A spline smoothing homotopy method for nonconvex nonlinear programming

DOI10.1080/02331934.2015.1064122zbMATH Open1338.90387OpenAlexW2277563817MaRDI QIDQ2810089FDOQ2810089

Authors: Li Dong, Bo Yu, 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

Recommendations

• scientific article; zbMATH DE number 6270274
• A combined homotopy method under quasi-cone condition for non-convex nonlinear programming with equality and inequality constrains
• A combined homotopy infeasible interior point method for nonconvex programming
• The aggregate constraint homotopy method for nonconvex nonlinear programming
• Solving nonlinear complementarity problem by a smoothing homotopy method

zbMATH Keywords

nonlinear programminghomotopy methodinterior-point methodspline function

Mathematics Subject Classification ID

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

Cites Work

• On some efficient interior point methods for nonlinear convex programming
• A combined homotopy interior point method for convex nonlinear 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 smoothing Newton method for semi-infinite programming
• A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
• Uniform approximation of min/max functions by smooth splines
• The aggregate constraint homotopy method for nonconvex nonlinear programming

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A spline smoothing Newton method for semi-infinite minimax problems
• A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
• A spline smoothing Newton method for finite minimax problems

This page was built for publication: A spline smoothing homotopy method for nonconvex nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810089)