File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10915-021-01409-y
- Scopus: eid_2-s2.0-85100252461
- WOS: WOS:000614052600001
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Complexity of Proximal Augmented Lagrangian for Nonconvex Optimization with Nonlinear Equality Constraints
Title | Complexity of Proximal Augmented Lagrangian for Nonconvex Optimization with Nonlinear Equality Constraints |
---|---|
Authors | |
Keywords | Complexity analysis Newton-conjugate-gradient Nonconvex optimization Optimization with nonlinear equality constraints Proximal augmented Lagrangian |
Issue Date | 2021 |
Citation | Journal of Scientific Computing, 2021, v. 86, n. 3, article no. 38 How to Cite? |
Abstract | We analyze worst-case complexity of a Proximal augmented Lagrangian (Proximal AL) framework for nonconvex optimization with nonlinear equality constraints. When an approximate first-order (second-order) optimal point is obtained in the subproblem, an ϵ first-order (second-order) optimal point for the original problem can be guaranteed within O(1 / ϵ2-η) outer iterations (where η is a user-defined parameter with η∈ [0 , 2] for the first-order result and η∈ [1 , 2] for the second-order result) when the proximal term coefficient β and penalty parameter ρ satisfy β= O(ϵη) and ρ= Ω(1 / ϵη) , respectively. We also investigate the total iteration complexity and operation complexity when a Newton-conjugate-gradient algorithm is used to solve the subproblems. Finally, we discuss an adaptive scheme for determining a value of the parameter ρ that satisfies the requirements of the analysis. |
Persistent Identifier | http://hdl.handle.net/10722/309279 |
ISSN | 2021 Impact Factor: 2.843 2020 SCImago Journal Rankings: 1.530 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xie, Yue | - |
dc.contributor.author | Wright, Stephen J. | - |
dc.date.accessioned | 2021-12-15T03:59:53Z | - |
dc.date.available | 2021-12-15T03:59:53Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | Journal of Scientific Computing, 2021, v. 86, n. 3, article no. 38 | - |
dc.identifier.issn | 0885-7474 | - |
dc.identifier.uri | http://hdl.handle.net/10722/309279 | - |
dc.description.abstract | We analyze worst-case complexity of a Proximal augmented Lagrangian (Proximal AL) framework for nonconvex optimization with nonlinear equality constraints. When an approximate first-order (second-order) optimal point is obtained in the subproblem, an ϵ first-order (second-order) optimal point for the original problem can be guaranteed within O(1 / ϵ2-η) outer iterations (where η is a user-defined parameter with η∈ [0 , 2] for the first-order result and η∈ [1 , 2] for the second-order result) when the proximal term coefficient β and penalty parameter ρ satisfy β= O(ϵη) and ρ= Ω(1 / ϵη) , respectively. We also investigate the total iteration complexity and operation complexity when a Newton-conjugate-gradient algorithm is used to solve the subproblems. Finally, we discuss an adaptive scheme for determining a value of the parameter ρ that satisfies the requirements of the analysis. | - |
dc.language | eng | - |
dc.relation.ispartof | Journal of Scientific Computing | - |
dc.subject | Complexity analysis | - |
dc.subject | Newton-conjugate-gradient | - |
dc.subject | Nonconvex optimization | - |
dc.subject | Optimization with nonlinear equality constraints | - |
dc.subject | Proximal augmented Lagrangian | - |
dc.title | Complexity of Proximal Augmented Lagrangian for Nonconvex Optimization with Nonlinear Equality Constraints | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s10915-021-01409-y | - |
dc.identifier.scopus | eid_2-s2.0-85100252461 | - |
dc.identifier.volume | 86 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | article no. 38 | - |
dc.identifier.epage | article no. 38 | - |
dc.identifier.eissn | 1573-7691 | - |
dc.identifier.isi | WOS:000614052600001 | - |