The following pages link to Andrei T. Patrascu (Q679948):
Displayed 25 items.
- (Q461436) (redirect page) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization (Q519779) (← links)
- Global aspects of the renormalization group and the hierarchy problem (Q679949) (← links)
- Entanglement, space-time and the Mayer-Vietoris theorem (Q683134) (← links)
- Multipartite entanglement via the Mayer-Vietoris theorem (Q1709294) (← links)
- Stochastic proximal splitting algorithm for composite minimization (Q2047212) (← links)
- On finite termination of an inexact proximal point algorithm (Q2171164) (← links)
- Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC (Q2798546) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- The Universal Coefficient Theorem and Quantum Field Theory (Q2822803) (← links)
- Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization (Q2982665) (← links)
- Black holes, information, and the universal coefficient theorem (Q3185689) (← links)
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525) (← links)
- On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization (Q4559493) (← links)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization (Q5162590) (← links)
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
- Gauge is quantum? (Q6049620) (← links)
- Spacetime vacuum as a correlated quantum channel, dual to gravitational memory (Q6170014) (← links)
- Iteration complexity analysis of random coordinate descent methods for $\ell_0$ regularized convex problems (Q6250156) (← links)
- Quantization, Holography and the Universal Coefficient Theorem (Q6250533) (← links)
- DuQuad: an inexact (augmented) dual first order algorithm for quadratic programming (Q6261116) (← links)
- Randomized projection methods for convex feasibility problems: conditioning and convergence rates (Q6296481) (← links)