11 citations · 46 across the 15 of their papers we have counts for
4 papers · 1 filter
Complexity certifications of first order inexact Lagrangian methods for general convex programming
Ion Necoara, Andrei Patrascu, Angelia Nedić
In this chapter we derive computational complexity certifications of first order inexact dual methods for solving general smooth constrained convex problems which can arise in real…
Complexity of first order inexact Lagrangian and penalty methods for conic convex programming
Ion Necoara, Andrei Patrascu, Francois Glineur
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 ma…
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
Andrei Patrascu, Ion Necoara, Quoc Tran-Dinh
In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combinatio…
DuQuad: an inexact (augmented) dual first order algorithm for quadratic programming
Ion Necoara, Andrei Patrascu
In this paper we present the solver DuQuad specialized for solving general convex quadratic problems arising in many engineering applications. When it is difficult to project on th…