An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
Date
2013
Authors
Burachik, R.S.
Iusem, A.N.
Melo, J.G.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Journal of Optimization Theory and Applications, 2013; 157(1):108-131
Statement of Responsibility
Conference Name
Abstract
We consider a primal optimization problem in a reflexive Banach space and a duality scheme via generalized augmented Lagrangians. For solving the dual problem (in a Hilbert space), we introduce and analyze a new parameterized Inexact Modified Subgradient (IMSg) algorithm. The IMSg generates a primal-dual sequence, and we focus on two simple new choices of the stepsize. We prove that every weak accumulation point of the primal sequence is a primal solution and the dual sequence converges weakly to a dual solution, as long as the dual optimal set is nonempty. Moreover, we establish primal convergence even when the dual optimal set is empty. Our second choice of the stepsize gives rise to a variant of IMSg which has finite termination.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2012 Springer Science+Business Media, LCC