default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei Patrascu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j11]Andrei Patrascu
, Paul Irofti:
On finite termination of an inexact Proximal Point algorithm. Appl. Math. Lett. 134: 108348 (2022)- 2021
- [j10]Andrei Patrascu, Paul Irofti:
Stochastic proximal splitting algorithm for composite minimization. Optim. Lett. 15(6): 2255-2273 (2021) - 2019
- [j9]Ion Necoara, Andrei Patrascu, François Glineur:
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Methods Softw. 34(2): 305-335 (2019) - [j8]Ion Necoara, Peter Richtárik, Andrei Patrascu:
Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates. SIAM J. Optim. 29(4): 2814-2852 (2019) - 2018
- [j7]Andrei Patrascu, Ion Necoara:
On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization. IEEE Trans. Autom. Control. 63(10): 3317-3329 (2018) - 2017
- [j6]Andrei Patrascu, Ion Necoara:
Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization. J. Mach. Learn. Res. 18: 198:1-198:42 (2017) - [j5]Andrei Patrascu, Ion Necoara, Quoc Tran-Dinh:
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization. Optim. Lett. 11(3): 609-626 (2017) - 2016
- [j4]Ion Necoara, Andrei Patrascu:
Iteration complexity analysis of dual first-order methods for conic convex programming. Optim. Methods Softw. 31(3): 645-678 (2016) - 2015
- [j3]Andrei Patrascu, Ion Necoara:
Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization. J. Glob. Optim. 61(1): 19-46 (2015) - [j2]Andrei Patrascu, Ion Necoara:
Random Coordinate Descent Methods for ℓ0 Regularized Convex Optimization. IEEE Trans. Autom. Control. 60(7): 1811-1824 (2015) - 2014
- [j1]Ion Necoara, Andrei Patrascu:
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints. Comput. Optim. Appl. 57(2): 307-337 (2014)
Conference and Workshop Papers
- 2022
- [c9]Paul Irofti, Cristian Rusu, Andrei Patrascu:
Dictionary Learning with Uniform Sparse Representations for Anomaly Detection. ICASSP 2022: 3378-3382 - [c8]Paul Irofti, Andrei Patrascu, Andrei Iulian Hîji:
Unsupervised Abnormal Traffic Detection through Topological Flow Analysis. COMM 2022: 1-6 - 2018
- [c7]Ion Necoara, Andrei Patrascu:
OR-SAGA: Over-relaxed stochastic average gradient mapping algorithms for finite sum minimization. ECC 2018: 489-494 - 2016
- [c6]Andrei Patrascu, Ion Necoara:
Complexity certifications of inexact projection primal gradient method for convex problems: Application to embedded MPC. MED 2016: 125-130 - 2015
- [c5]Ion Necoara, Andrei Patrascu:
On the behavior of first-order penalty methods for conic constrained convex programming when Lagrange multipliers do not exist. CDC 2015: 1378-1383 - [c4]Andrei Patrascu, Ion Necoara, Rolf Findeisen:
Rate of convergence analysis of a dual fast gradient method for general convex optimization. CDC 2015: 3311-3316 - [c3]Andrei Patrascu, Ion Necoara:
Random Coordinate Descent Methods for Sparse Optimization: Application to Sparse Control. CSCS 2015: 909-914 - 2014
- [c2]Andrei Patrascu, Ion Necoara, Panagiotis Patrinos:
A proximal alternating minimization method for ℓ0-regularized nonlinear optimization problems: application to state estimation. CDC 2014: 4254-4259 - 2013
- [c1]Andrei Patrascu, Ion Necoara:
A random coordinate descent algorithm for large-scale sparse nonconvex optimization. ECC 2013: 2789-2794
Informal and Other Publications
- 2024
- [i10]Andrei Patrascu, Cristian Rusu, Paul Irofti:
Learning Explicitly Conditioned Sparsifying Transforms. CoRR abs/2403.03168 (2024) - [i9]Paul Irofti, Andrei Iulian Hîji, Andrei Patrascu, Nicolae Cleju:
Fusing Dictionary Learning and Support Vector Machines for Unsupervised Anomaly Detection. CoRR abs/2404.04064 (2024) - 2022
- [i8]Paul Irofti, Cristian Rusu, Andrei Patrascu:
Dictionary Learning with Uniform Sparse Representations for Anomaly Detection. CoRR abs/2201.03869 (2022) - [i7]Paul Irofti, Andrei Patrascu, Andrei Iulian Hîji:
Unsupervised Abnormal Traffic Detection through Topological Flow Analysis. CoRR abs/2205.07109 (2022) - 2021
- [i6]Andrei Patrascu, Paul Irofti:
Computational complexity of Inexact Proximal Point Algorithm for Convex Optimization under Holderian Growth. CoRR abs/2108.04482 (2021) - 2020
- [i5]Andrei Patrascu, Ciprian Paduraru, Paul Irofti:
Stochastic Proximal Gradient Algorithm with Minibatches. Application to Large Scale Learning Models. CoRR abs/2003.13332 (2020) - 2019
- [i4]Andrei Patrascu:
On convergence rate of stochastic proximal point algorithm without strong convexity, smoothness or bounded gradients. CoRR abs/1901.08663 (2019) - [i3]Paul Irofti, Andrei Patrascu, Andra Baltoiu:
Fraud Detection in Networks: State-of-the-art. CoRR abs/1910.11299 (2019) - [i2]Andra Baltoiu, Andrei Patrascu, Paul Irofti:
Community-Level Anomaly Detection for Anti-Money Laundering. CoRR abs/1910.11313 (2019) - [i1]Andrei Patrascu, Paul Irofti:
Stochastic proximal splitting algorithm for stochastic composite minimization. CoRR abs/1912.02039 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
