On a modified subgradient algorithm for dual problems via sharp augmented lagrangian
Files
(Published version)
Date
2006
Authors
Burachik, R.S.
Gasimov, R.
Ismayilova, N.
Kaya, C.Y.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Journal of Global Optimization, 2006; 34(1):55-78
Statement of Responsibility
Conference Name
Abstract
We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and an optimal control problem.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2006 Springer