A. Pătraşcu

发表

Trinuclear Nickel(II) and Cobalt(II) Complexes Constructed from Mannich-Schiff-Base Ligands: Synthesis, Crystal Structures, and Magnetic Properties

M. Hillebrand, F. Lloret, M. Andruh, 2019 .

Synthesis, Characterization, and In Vitro Insulin-Mimetic Activity Evaluation of Valine Schiff Base Coordination Compounds of Oxidovanadium(V)

M. Calin, M. Turtoi, Maria Anghelache, 2021, Biomedicines.

Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth

Paul Irofti, A. Pătraşcu, 2021, 2108.04482.

Computational complexity of Inexact Proximal Point Algorithm for Convex Optimization under Holderian Growth

Paul Irofti, A. Pătraşcu, 2021, ArXiv.

One-dimensional coordination polymers constructed from binuclear 3d–4f nodes and isonicotinato spacer

M. Vaz, R. A. A. Cassaro, M. Novak, 2016 .

Quick survey of graph-based fraud detection methods

Paul Irofti, Andra Baltoiu, A. Pătraşcu, 2019, 1910.11299.

Finite convergence of the inexact proximal gradient method to sharp minima

A. Pătraşcu, 2022 .

Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization

I. Necoara, A. Pătraşcu, 2014, Journal of Global Optimization.

SMM Behavior Tuned by an Exchange Coupling LEGO Approach for Chimeric Compounds: First 2p-3d-4f Heterotrispin Complexes with Different Metal Ions Bridged by One Aminoxyl Group.

M. Briganti, F. Totti, M. Vaz, 2019, Inorganic chemistry.

A chimeric design of heterospin 2p-3d, 2p-4f, and 2p-3d-4f complexes using a novel family of paramagnetic dissymmetric compartmental ligands.

A. Caneschi, M. Briganti, F. Totti, 2017, Chemical communications.

Heterometallic metallacyclophanes constructed from side-off bicompartmental ligands

M. Andruh, S. Ionescu, Mihaela I. Mocanu, 2020 .

Lanthanide doped TiO2: Coexistence of discrete and continuous dopant distribution in anatase phase

A. Patrascu, C. Tiseanu, B. Cojocaru, 2021 .

A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints

Ion Necoara, Andrei Patrascu, I. Necoara, 2013, Comput. Optim. Appl..

Complexity certifications of inexact projection primal gradient method for convex problems: Application to embedded MPC

Ion Necoara, Andrei Patrascu, I. Necoara, 2016, 2016 24th Mediterranean Conference on Control and Automation (MED).

Rate of convergence analysis of a dual fast gradient method for general convex optimization

Rolf Findeisen, Ion Necoara, Andrei Patrascu, 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

Complexity certifications of first order inexact Lagrangian methods for general convex programming

Ion Necoara, Angelia Nedi'c, Andrei Patrascu, 2015, 1506.05328.

A linear MPC algorithm for embedded systems with computational complexity guarantees

Ion Necoara, Morten Hovd, Florin Stoican, 2014, 2014 18th International Conference on System Theory, Control and Computing (ICSTCC).

Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization

Ion Necoara, Andrei Patrascu, I. Necoara, 2017, J. Mach. Learn. Res..

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

Ion Necoara, François Glineur, Andrei Patrascu, 2015, Optim. Methods Softw..

Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization

Ion Necoara, Quoc Tran-Dinh, Andrei Patrascu, 2015, Optim. Lett..

Graph Anomaly Detection Using Dictionary Learning

Paul Irofti, Andra Baltoiu, A. Pătraşcu, 2020 .

Community-Level Anomaly Detection for Anti-Money Laundering pdf

Andra Baltoiu, Andrei Patrascu, Paul Irofti, 2019, ArXiv.

Penalty decomposition method for solving ℓ0 regularized problems: Application to trend filtering

I. Necoara, A. Patrascu, A. Pătraşcu, 2014, 2014 18th International Conference on System Theory, Control and Computing (ICSTCC).

Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates

Peter Richtárik, Ion Necoara, Andrei Patrascu, 2019, SIAM J. Optim..

Randomized projection methods for convex feasibility problems: conditioning and convergence rates

Ion Necoara, Andrei Patrascu, Peter Richtarik, 2018, 1801.04873.

Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization

I. Necoara, A. Patrascu, A. Pătraşcu, 2017, 1706.06297.

Coordination polymers constructed from triorganotin(IV) nodes and fumarato spacers

M. Andruh, I. Haiduc, C. Silvestru, 2019, Journal of Organometallic Chemistry.

Random Coordinate Descent Methods for $\ell_{0}$ Regularized Convex Optimization

Ion Necoara, Andrei Patrascu, I. Necoara, 2014, IEEE Transactions on Automatic Control.

The European Radiological Data Exchange Platform (EURDEP): 25 years of monitoring data exchange

A. Patrascu, G. Cinelli, K. Bogucarskis, 2020 .

The European Union Radiological Data Exchange Platform (EURDEP): 25 years of monitoring data exchange

A. Patrascu, G. Cinelli, K. Bogucarskis, 2019 .

A random coordinate descent algorithm for large-scale sparse nonconvex optimization

Ion Necoara, Andrei Patrascu, I. Necoara, 2013, 2013 European Control Conference (ECC).

On convergence rate of stochastic proximal point algorithm without strong convexity, smoothness or bounded gradients

A. Pătraşcu, 2019, ArXiv.

New nonasymptotic convergence rates of stochastic proximal pointalgorithm for convex optimization problems with many constraints

Andrei Patrascu, A. Pătraşcu, 2019, 1901.08663.

New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization

A. Patrascu, A. Pătraşcu, 2020, Optimization.

Stochastic Proximal Gradient Algorithm with Minibatches. Application to Large Scale Learning Models pdf

Ciprian Paduraru, Andrei Patrascu, Paul Irofti, 2020, ArXiv.

Stochastic proximal splitting algorithm for composite minimization

Paul Irofti, Andrei A. Patrascu, Paul Irofti, 2019, Optimization Letters.

Stochastic proximal splitting algorithm for stochastic composite minimization pdf

Andrei Patrascu, Paul Irofti, Paul Irofti, 2019, ArXiv.

Stochastic SPG with Minibatches

A. Patrascu, C. Paduraru, Paul Irofti, 2020 .

Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization

I. Necoara, Q. Tran-Dinh, A. Pătraşcu, 2016, Optimization Letters.

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

Ion Necoara, François Glineur, Andrei Patrascu, 2015 .

Iteration complexity analysis of dual first-order methods for conic convex programming

Ion Necoara, Andrei Patrascu, I. Necoara, 2014, Optim. Methods Softw..

Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization

Ion Necoara, Andrei Patrascu, I. Necoara, 2013, Journal of Global Optimization.

A chimeric design of heterospin 2p-3d, 2p-4f, and 2p-3d-4f complexes using a novel family of paramagnetic dissymmetric compartmental ligands.

A. Caneschi, M. Briganti, F. Totti, 2017, Chemical communications.