Pages that link to "Item:Q5139832"
From MaRDI portal
The following pages link to Contracting Proximal Methods for Smooth Convex Optimization (Q5139832):
Displaying 12 items.
- Accelerated proximal envelopes: application to componentwise methods (Q2116598) (← links)
- On the computational efficiency of catalyst accelerated coordinate descent (Q2117631) (← links)
- Accelerated meta-algorithm for convex optimization problems (Q2656390) (← links)
- Near-Optimal Hyperfast Second-Order Method for Convex Optimization (Q4965110) (← links)
- Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
- Greedy Quasi-Newton Methods with Explicit Superlinear Convergence (Q5853572) (← links)
- High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
- Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)
- Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization (Q6114954) (← links)
- Super-Universal Regularized Newton Method (Q6136654) (← links)
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems (Q6182323) (← links)
- Gradient regularization of Newton method with Bregman distances (Q6201850) (← links)
