Pages that link to "Item:Q2355332"
From MaRDI portal
The following pages link to Adaptive restart for accelerated gradient schemes (Q2355332):
Displaying 50 items.
- On consistency and sparsity for high-dimensional functional time series with application to autoregressions (Q2108488) (← links)
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
- Restarting Frank-Wolfe: faster rates under Hölderian error bounds (Q2116603) (← links)
- Additive Schwarz methods for convex optimization with backtracking (Q2122660) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition (Q2128612) (← links)
- Accelerated proximal gradient method for bi-modulus static elasticity (Q2138312) (← links)
- A parallel Tseng's splitting method for solving common variational inclusion applied to signal recovery problems (Q2167271) (← links)
- Optimization for deep learning: an overview (Q2218095) (← links)
- An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
- An accelerated Uzawa method for application to frictionless contact problem (Q2228370) (← links)
- Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
- Nesterov-aided stochastic gradient methods using Laplace approximation for Bayesian design optimization (Q2309392) (← links)
- Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis (Q2311982) (← links)
- Generalized self-concordant functions: a recipe for Newton-type methods (Q2330645) (← links)
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
- Adaptive Euclidean maps for histograms: generalized Aitchison embeddings (Q2353001) (← links)
- A fast first-order optimization approach to elastoplastic analysis of skeletal structures (Q2358083) (← links)
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization (Q2361128) (← links)
- A secant-based Nesterov method for convex functions (Q2361131) (← links)
- Combining fast inertial dynamics for convex optimization with Tikhonov regularization (Q2408626) (← links)
- Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
- Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) (← links)
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
- Fast proximal algorithms for nonsmooth convex optimization (Q2661564) (← links)
- Robust hybrid zero-order optimization algorithms with acceleration via averaging in time (Q2662325) (← links)
- Accelerated additive Schwarz methods for convex optimization with adaptive restart (Q2666023) (← links)
- An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation (Q2666090) (← links)
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming (Q2667040) (← links)
- Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) (← links)
- Proximal gradient methods for general smooth graph total variation model in unsupervised learning (Q2674267) (← links)
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
- Convergence rates of the heavy-ball method under the Łojasiewicz property (Q2687044) (← links)
- A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
- A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem (Q2696923) (← links)
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← links)
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
- Activity Identification and Local Linear Convergence of Forward--Backward-type Methods (Q2968179) (← links)
- Non-monotone Behavior of the Heavy Ball Method (Q3296870) (← links)
- Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation (Q3379602) (← links)
- Search Direction Correction with Normalized Gradient Makes First-Order Methods Faster (Q3382800) (← links)
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841) (← links)
- Convergence Rates of Inertial Forward-Backward Algorithms (Q4609474) (← links)
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia (Q4622890) (← links)
- A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization (Q4637039) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- Proximal extrapolated gradient methods for variational inequalities (Q4638915) (← links)
- Accelerated Residual Methods for the Iterative Solution of Systems of Equations (Q4685335) (← links)
