Ion Necoara

Prof. Dr. Ion Necoara

Faculty of Automation and Computers, University Politehnica of Bucharest, 313 Sp. Indenpendentei, 060042 Bucharest, Romania

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 January 2018 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
Ion NecoaraIon Necoara
Ion Necoara
YNYu. Nesterov
Yu. Nesterov
FGF. Glineur
F. Glineur

19 September 2013 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
Ion NecoaraIon Necoara
Ion Necoara
APAndrei Patrascu
Andrei Patrascu

2 February 2014 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
APAndrei Patrascu
Andrei Patrascu
Ion NecoaraIon Necoara
Ion Necoara

5 October 2017 in Optimization Methods and Software
Verified
Journal Article
Closed access
Ion NecoaraIon Necoara
Ion Necoara
APA. Patrascu
A. Patrascu
FGF. Glineur
F. 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 may not have optimal Lagrange multipliers that close the duality gap. We first assume the existence of optimal Lagrange multipliers and study primal–dual first-order methods based on inexact information and augmented Lagrangian smoothing or Nesterov-type smoothing. For inexact (fast) gradient augmented Lagrangian methods, we derive an overall computational complexity of projections onto a simple primal set in order to attain an ε-optimal solution of the conic convex problem. For the inexact fast gradient method combined with Nesterov-type smoothing, we derive computational complexity projections onto the same set. Then, we assume that optimal Lagrange multipliers might not exist for the cone-constrained convex problem, and analyse the fast gradient method for solving penalty reformulations of the problem. For the fast gradient method combined with penalty framework, we also derive an overall computational complexity of projections onto a simple primal set to attain an ε-optimal solution for the original problem.

12 January 2017 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
Ion NecoaraIon Necoara
Ion Necoara
YNYurii Nesterov
Yurii Nesterov
FGFrançois Glineur
François Glineur

11 March 2016 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
APAndrei Patrascu
Andrei Patrascu
Ion NecoaraIon Necoara
Ion Necoara
QTQuoc Tran-Dinh
Quoc Tran-Dinh