Seguir
Andrei Patrascu
Andrei Patrascu
Dirección de correo verificada de fmi.unibuc.ro - Página principal
Título
Citado por
Citado por
Año
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
I Necoara, A Patrascu
Computational Optimization and Applications 57 (2), 307-337, 2014
1072014
Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
A Patrascu, I Necoara
Journal of Global Optimization 61 (1), 19-46, 2015
1012015
Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
A Patrascu, I Necoara
Journal of Machine Learning Research 18 (198), 1-42, 2018
842018
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
I Necoara, A Patrascu, F Glineur
Optimization Methods and Software 34 (2), 305-335, 2019
522019
Randomized projection methods for convex feasibility: Conditioning and convergence rates
I Necoara, P Richtárik, A Patrascu
SIAM Journal on Optimization 29 (4), 2814-2852, 2019
482019
Iteration complexity analysis of dual first-order methods for conic convex programming
I Necoara, A Patrascu
Optimization Methods and Software 31 (3), 645-678, 2016
38*2016
Random Coordinate Descent Methods forRegularized Convex Optimization
A Patrascu, I Necoara
IEEE Transactions on Automatic Control 60 (7), 1811-1824, 2015
352015
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
A Patrascu, I Necoara, Q Tran-Dinh
Optimization Letters 11, 609-626, 2017
272017
On the convergence of inexact projection primal first-order methods for convex minimization
A Patrascu, I Necoara
IEEE Transactions on Automatic Control 63 (10), 3317-3329, 2018
152018
Community-level anomaly detection for anti-money laundering
A Baltoiu, A Patrascu, P Irofti
arXiv preprint arXiv:1910.11313, 2019
72019
Rate of convergence analysis of a dual fast gradient method for general convex optimization
A Patrascu, I Necoara, R Findeisen
2015 54th IEEE Conference on Decision and Control (CDC), 3311-3316, 2015
72015
DuQuad: an inexact (augmented) dual first order algorithm for quadratic programming
I Necoara, A Patrascu
arXiv preprint arXiv:1504.05708, 2015
52015
Fraud detection in networks: State-of-the-art
P Irofti, A Patrascu, A Baltoiu
arXiv preprint arXiv:1910.11299, 2019
42019
Efficient first order methods for sparse convex optimization
A Patrascu
PhD Thesis. University Politehnica of Bucharest, 2015. http://acse. pub. ro …, 0
4
Complexity certifications of first-order inexact lagrangian methods for general convex programming: Application to real-time mpc
I Necoara, A Patrascu, A Nedić
Developments in Model-Based Optimization and Control: Distributed Control …, 2015
32015
A random coordinate descent algorithm for large-scale sparse nonconvex optimization
A Patrascu, I Necoara
2013 European Control Conference (ECC), 2789-2794, 2013
32013
Complexity certifications of inexact projection primal gradient method for convex problems: Application to embedded MPC
A Patrascu, I Necoara
2016 24th Mediterranean Conference on Control and Automation (MED), 125-130, 2016
22016
Implementable fast augmented Lagrangian optimization algorithm with application in embedded MPC
A Patrascu, I Necoara, M Barbu, S Caraman
2015 19th International Conference on System Theory, Control and Computing …, 2015
22015
A proximal alternating minimization method for ℓ0-regularized nonlinear optimization problems: application to state estimation
A Patrascu, I Necoara, P Patrinos
53rd IEEE Conference on Decision and Control, 4254-4259, 2014
22014
A linear MPC algorithm for embedded systems with computational complexity guarantees
I Necoara, F Stoican, D Clipici, A Patrascu, M Hovd
2014 18th International Conference on System Theory, Control and Computing …, 2014
22014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20