Andrei T. Patrascu

From MaRDI portal
(Redirected from Andrei T. Patrascu)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Quantum coherence and holographic emergence of de Sitter cosmology
Nuclear Physics. B
2026-09-15Paper
Type-III QFT, density matrices, and coherence defects: A non-strict formulation of quantum state ontology
International Journal of Theoretical Physics
2026-07-27Paper
Strings and missing wormhole entanglement
International Journal of Theoretical Physics
2024-12-10Paper
Gauge is quantum?
International Journal of Theoretical Physics
2023-09-15Paper
Spacetime vacuum as a correlated quantum channel, dual to gravitational memory
International Journal of Theoretical Physics
2023-08-15Paper
On finite termination of an inexact proximal point algorithm
Applied Mathematics Letters
2022-09-23Paper
New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
Optimization
2021-11-03Paper
Stochastic proximal splitting algorithm for composite minimization
Optimization Letters
2021-08-19Paper
Randomized projection methods for convex feasibility: conditioning and convergence rates
SIAM Journal on Optimization
2019-11-08Paper
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
Optimization Methods & Software
2019-02-18Paper
On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization
IEEE Transactions on Automatic Control
2018-12-04Paper
Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
(available as arXiv preprint)
2018-11-22Paper
Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization2018-11-22Paper
Multipartite entanglement via the Mayer-Vietoris theorem
Journal of High Energy Physics
2018-03-27Paper
Entanglement, space-time and the Mayer-Vietoris theorem
Journal of High Energy Physics
2018-02-05Paper
Global aspects of the renormalization group and the hierarchy problem
Physics Letters B
2018-01-22Paper
Randomized projection methods for convex feasibility problems: conditioning and convergence rates2018-01-15Paper
Randomized projection methods for convex feasibility problems: conditioning and convergence rates
(available as arXiv preprint)
2018-01-01Paper
Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization
IEEE Transactions on Automatic Control
2017-05-16Paper
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
Optimization Letters
2017-04-05Paper
The universal coefficient theorem and quantum field theory. A topological guide for the duality seeker
Springer Theses
2016-10-05Paper
Black holes, information, and the universal coefficient theorem
Journal of Mathematical Physics
2016-08-04Paper
Iteration complexity analysis of dual first-order methods for conic convex programming
Optimization Methods & Software
2016-06-29Paper
Complexity certifications of first-order inexact Lagrangian methods for general convex programming: application to real-time MPC
Developments in Model-Based Optimization and Control
2016-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 optimization
Journal of Global Optimization
2015-01-16Paper
DuQuad: an inexact (augmented) dual first order algorithm for quadratic programming
(available as arXiv preprint)
2015-01-01Paper
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
Computational Optimization and Applications
2014-10-10Paper
Quantization, Holography and the Universal Coefficient Theorem2014-04-07Paper
Iteration complexity analysis of random coordinate descent methods for \ell₀ regularized convex problems2014-03-26Paper
Iteration complexity analysis of random coordinate descent methods for $\ell_0$ regularized convex problems
(available as arXiv preprint)
2014-01-01Paper
Quantization, Holography and the Universal Coefficient Theorem
(available as arXiv preprint)
2014-01-01Paper


Research outcomes over time


This page was built for person: Andrei T. Patrascu