A spline smoothing homotopy method for nonconvex nonlinear programming
From MaRDI portal
Publication:2810089
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
Cites work
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- A combined homotopy interior point method for convex nonlinear programming
- A path following algorithm for a class of convex programming problems
- 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
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- On some efficient interior point methods for nonlinear convex programming
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- Uniform approximation of min/max functions by smooth splines
Cited in
(5)- A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
- scientific article; zbMATH DE number 19407 (Why is no real title available?)
- scientific article; zbMATH DE number 6270274 (Why is no real title available?)
- A spline smoothing Newton method for semi-infinite minimax problems
- 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)