Pages that link to "Item:Q2355332"
From MaRDI portal
The following pages link to Adaptive restart for accelerated gradient schemes (Q2355332):
Displaying 26 items.
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
- Accelerated forward–backward algorithms for structured monotone inclusions (Q6498412) (← links)
- Additive Schwarz methods for semilinear elliptic problems with convex energy functionals: convergence rate independent of nonlinearity (Q6498601) (← links)
- Learning weakly convex regularizers for convergent image-reconstruction algorithms (Q6541905) (← links)
- Adaptation and assessement of projected Nesterov accelerated gradient flow to compute stationary states of nonlinear Schrödinger equations (Q6547142) (← links)
- A dual-primal finite element tearing and interconnecting method for nonlinear variational inequalities utilizing linear local problems (Q6554015) (← links)
- Estimation of off-the grid sparse spikes with over-parametrized projected gradient descent: theory and application (Q6557666) (← links)
- Parameter-free accelerated gradient descent for nonconvex minimization (Q6561381) (← links)
- A subgradient method with constant step-size for \(\ell_1\)-composite optimization (Q6564822) (← links)
- Subgradient regularized multivariate convex regression at scale (Q6573015) (← links)
- MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization (Q6587341) (← links)
- Nonlinear conjugate gradient for smooth convex functions (Q6590465) (← links)
- A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems (Q6593828) (← links)
- Iteration complexity of fixed-step methods by Nesterov and Polyak for convex quadratic functions (Q6596345) (← links)
- Stochastic algorithms with geometric step decay converge linearly on sharp functions (Q6608032) (← links)
- Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior (Q6611327) (← links)
- Accelerated SVD-based initialization for nonnegative matrix factorization (Q6616157) (← links)
- Parameter-free FISTA by adaptive restart and backtracking (Q6622751) (← links)
- Additive Schwarz methods for convex optimization -- convergence theory and acceleration (Q6630175) (← links)
- Additive Schwarz methods for fourth-order variational inequalities (Q6639515) (← links)
- Decentralized concurrent learning with coordinated momentum and restart (Q6648490) (← links)
- Several kinds of acceleration techniques for unconstrained optimization first-order algorithms (Q6665360) (← links)
- Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)
- An improved parameterized fast iterative shrinkage-thresholding algorithm with adaptive step size and its applications (Q6670800) (← links)
- Fast symplectic integrator for Nesterov-type acceleration method (Q6671897) (← links)