An inexact modified subgradient algorithm for nonconvex optimization
Open Access
- 29 January 2008
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 45 (1) , 1-24
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- An update rule and a convergence result for a penalty function methodJournal of Industrial and Management Optimization, 2007
- The Lagrangian Globalization Method for Nonsmooth Constrained EquationsComputational Optimization and Applications, 2006
- On the absence of duality gap for Lagrange-type functionsJournal of Industrial and Management Optimization, 2005
- Convergence of Approximate and Incremental Subgradient Methods for Convex OptimizationSIAM Journal on Optimization, 2004
- Incremental Subgradient Methods for Nondifferentiable OptimizationSIAM Journal on Optimization, 2001
- A variable target value method for nondifferentiable optimizationOperations Research Letters, 2000
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary PointSIAM Journal on Optimization, 1998
- Convergence Properties of the Nelder--Mead Simplex Method in Low DimensionsSIAM Journal on Optimization, 1998
- A generalized subgradient method with relaxation stepMathematical Programming, 1995
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981