A smoothing Levenberg–Marquardt method for generalized semi-infinite programming
Authors:
- 26 March 2013
- journal article
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 32 (1) , 89-105
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- The Semismooth Approach for Semi-Infinite Programming without Strict ComplementaritySIAM Journal on Optimization, 2009
- Augmented Lagrangians in semi-infinite programmingMathematical Programming, 2007
- On the Use of Augmented Lagrangians in the Solution of Generalized Semi-Infinite Min-Max ProblemsComputational Optimization and Applications, 2005
- SIPAMPLACM Transactions on Mathematical Software, 2004
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max ProblemsSIAM Journal on Optimization, 2003
- Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient MethodsSIAM Journal on Optimization, 2003
- Solving Semi-Infinite Optimization Problems with Interior Point TechniquesSIAM Journal on Control and Optimization, 2003
- On the Rate of Convergence of the Levenberg-Marquardt Method2001
- Generalized semi-infinite programming: Theory and methodsEuropean Journal of Operational Research, 1999
- A trust region method for semi-infinite programming problemsInternational Journal of Systems Science, 1999