An inexact modified subgradient algorithm for nonconvex optimization
Files
(Published version)
Date
2010
Authors
Burachik, R.S.
Kaya, C.Y.
Mammadov, M.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Computational Optimization and Applications, 2010; 45(1):1-24
Statement of Responsibility
Conference Name
Abstract
We propose and analyze an inexact version of the modified subgradient (MSG) algorithm, which we call the IMSG algorithm, for nonsmooth and nonconvex optimization over a compact set. We prove that under an approximate, i.e. inexact, minimization of the sharp augmented Lagrangian, the main convergence properties of the MSG algorithm are preserved for the IMSG algorithm. Inexact minimization may allow to solve problems with less computational effort. We illustrate this through test problems, including an optimal bang-bang control problem, under several different inexactness schemes
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2008 Springer
Access Condition Notes: Postprint only available on Open Access