Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

Optimization Methods and Software, 2019 - Taylor & Francis
In this paper we present a complete iteration complexity analysis of inexact first-order
Lagrangian and penalty methods for solving cone-constrained convex problems that have or …
被引用次数：56 相关文章

Complexity of first order inexact Lagrangian and penalty methods for conic convex programming

I Necoara, A Patrascu, F Glineur - arXiv e-prints, 2015 - ui.adsabs.harvard.edu
In this paper we present a complete iteration complexity analysis of inexact first order
Lagrangian and penalty methods for solving cone constrained convex problems that have or …
[PDF] researchgate.net

[PDF][PDF] COMPLEXITY CERTIFICATIONS OF FIRST ORDER INEXACT LAGRANGIAN AND PENALTY METHODS FOR CONIC CONVEX PROGRAMMING

ION NECOARA, A PATRASCU… - arXiv preprint arXiv …, 2015 - researchgate.net
In this paper we analyze first order Lagrangian and penalty methods for general cone
constrained convex programming with bounded or unbounded optimal Lagrange multipliers …

[引用][C] Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

I Necoara, A Patrascu, F Glineur - 2019 - econpapers.repec.org
EconPapers: Complexity of first-order inexact Lagrangian and penalty methods for conic convex
programming EconPapers Economics at your fingertips EconPapers Home About EconPapers …
[PDF] uclouvain.be

[PDF][PDF] Complexity of first order inexact Lagrangian and penalty methods for conic convex programming

I Necoaraa, A Patrascua, F Glineurb - arXiv preprint arXiv …, 2015 - dial.uclouvain.be
Nesterov type smoothing we derive computational complexity O (1∈ 3/2) projections onto
the same set. Then, we assume that optimal Lagrange multipliers for the cone constrained …

[引用][C] Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

I Necoara, A Patrascu, F Glineur - 2019 - ideas.repec.org
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
IDEAS home Advanced search Economic literature: papers, articles, software, chapters, books …

Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming.

I Necoara, A Patrascu, F Glineur - Optimization Methods & …, 2019 - search.ebscohost.com
In this paper we present a complete iteration complexity analysis of inexact first-order
Lagrangian and penalty methods for solving cone-constrained convex problems that have or …

Complexity of first order inexact Lagrangian and penalty methods for conic convex programming

I Necoara, A Patrascu, F Glineur - arXiv preprint arXiv:1506.05320, 2015 - arxiv.org
In this paper we present a complete iteration complexity analysis of inexact first order
Lagrangian and penalty methods for solving cone constrained convex problems that have or …

Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

I Necoara, A Patrascu, F Glineur - Optimization Methods and …, 2019 - ingentaconnect.com
In this paper we present a complete iteration complexity analysis of inexact first-order
Lagrangian and penalty methods for solving cone-constrained convex problems that have or …

Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

I Necoara, A Patrascu, F Glineur - Optimization Methods and …, 2019 - dial.uclouvain.be
In this paper we present a complete iteration complexity analysis of inexact first-order
Lagrangian and penalty methods for solving cone-constrained convex problems that have or …