A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
- 16 December 2023
- journal article
- research article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 98 (3) , 411-433
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (No.11701350,No.1217021070)
This publication has 12 references indexed in Scilit:
- A spline smoothing homotopy method for nonconvex nonlinear programmingOptimization, 2015
- A constraint shifting homotopy method for general non-linear programmingOptimization, 2012
- Uniform approximation of min/max functions by smooth splinesJournal of Computational and Applied Mathematics, 2011
- A Smoothing Newton Method for Semi-Infinite ProgrammingJournal of Global Optimization, 2004
- The aggregate constraint homotopy method for nonconvex nonlinear programmingNonlinear Analysis, 2001
- Theory of Globally Convergent Probability-One Homotopies for Nonlinear ProgrammingSIAM Journal on Optimization, 2001
- Primal-Dual Interior Methods for Nonconvex Nonlinear ProgrammingSIAM Journal on Optimization, 1998
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problemNonlinear Analysis, 1998
- Numerical path following1997
- Algorithm 652ACM Transactions on Mathematical Software, 1987