Iteration-complexity of first-order penalty methods for convex programming
Iteration-complexity of first-order penalty methods for convex programming
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer-Verlag
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer-Verlag
Subjects
More information
Scope and Contents
Contents
This paper considers a special but broad class of convex programming problems whose feasible region is a simple compact convex set intersected with the inverse image of a closed convex cone under an affine transformation. It studies the computational complexity of quadratic penalty based methods for solving the above class of problems. An iteration...
Alternative Titles
Full title
Iteration-complexity of first-order penalty methods for convex programming
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1349435294
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1349435294
Other Identifiers
ISSN
0025-5610
E-ISSN
1436-4646
DOI
10.1007/s10107-012-0588-x
