Andrei T. Patrascu

From MaRDI portal
Revision as of 23:29, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Andrei T. Patrascu to Andrei T. Patrascu: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:679948

Available identifiers

zbMath Open patrascu.andrei-tudorMaRDI QIDQ679948

List of research outcomes





PublicationDate of PublicationType
Strings and missing wormhole entanglement2024-12-10Paper
Gauge is quantum?2023-09-15Paper
Spacetime vacuum as a correlated quantum channel, dual to gravitational memory2023-08-15Paper
On finite termination of an inexact proximal point algorithm2022-09-23Paper
New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization2021-11-03Paper
Stochastic proximal splitting algorithm for composite minimization2021-08-19Paper
Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates2019-11-08Paper
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming2019-02-18Paper
On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization2018-12-04Paper
Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization2018-11-22Paper
Multipartite entanglement via the Mayer-Vietoris theorem2018-03-27Paper
Entanglement, space-time and the Mayer-Vietoris theorem2018-02-05Paper
Global aspects of the renormalization group and the hierarchy problem2018-01-22Paper
Randomized projection methods for convex feasibility problems: conditioning and convergence rates2018-01-15Paper
Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization2017-05-16Paper
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization2017-04-05Paper
The Universal Coefficient Theorem and Quantum Field Theory2016-10-05Paper
Black holes, information, and the universal coefficient theorem2016-08-04Paper
Iteration complexity analysis of dual first-order methods for conic convex programming2016-06-29Paper
Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC2016-04-13Paper
DuQuad: an inexact (augmented) dual first order algorithm for quadratic programming2015-04-22Paper
Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization2015-01-16Paper
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints2014-10-10Paper
Quantization, Holography and the Universal Coefficient Theorem2014-04-07Paper
Iteration complexity analysis of random coordinate descent methods for $\ell_0$ regularized convex problems2014-03-26Paper

Research outcomes over time

This page was built for person: Andrei T. Patrascu