Pages that link to "Item:Q359630"
From MaRDI portal
The following pages link to Gradient methods for minimizing composite functions (Q359630):
Displaying 50 items.
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning (Q5254990) (← links)
- On the Generation of Sampling Schemes for Magnetic Resonance Imaging (Q5266399) (← links)
- A proximal partially parallel splitting method for separable convex programs (Q5268890) (← links)
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (Q5275297) (← links)
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
- Composite Convex Minimization Involving Self-concordant-Like Cost Functions (Q5356980) (← links)
- A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems (Q5372650) (← links)
- (Q5381111) (← links)
- An introduction to continuous optimization for imaging (Q5740077) (← links)
- Perturbation resilience of proximal gradient algorithm for composite objectives (Q5743220) (← links)
- An acceleration procedure for optimal first-order methods (Q5746718) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- The method of codifferential descent for convex and global piecewise affine optimization (Q5859002) (← links)
- An accelerated communication-efficient primal-dual optimization framework for structured machine learning (Q5859008) (← links)
- A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
- Complex-Valued Imaging with Total Variation Regularization: An Application to Full-Waveform Inversion in Visco-acoustic Media (Q5860276) (← links)
- Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction (Q5860374) (← links)
- A primal-dual flow for affine constrained convex optimization (Q5864593) (← links)
- Inexact model: a framework for optimization and variational inequalities (Q5865338) (← links)
- Universal intermediate gradient method for convex problems with inexact oracle (Q5865342) (← links)
- High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
- Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization (Q5869821) (← links)
- A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
- Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection (Q5882243) (← links)
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312) (← links)
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization (Q5883313) (← links)
- Composite nonsmooth optimization using approximate generalized gradient vectors (Q5959905) (← links)
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier (Q6038640) (← links)
- Accelerated differential inclusion for convex optimization (Q6042222) (← links)
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis (Q6043137) (← links)
- Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient (Q6046830) (← links)
- A diagonal finite element-projection-proximal gradient algorithm for elliptic optimal control problem (Q6048981) (← links)
- Stopping rules for gradient methods for non-convex problems with additive noise in gradient (Q6051170) (← links)
- A speed restart scheme for a dynamics with Hessian-driven damping (Q6086152) (← links)
- Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482) (← links)
- Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)
- Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
- An accelerated tensorial double proximal gradient method for total variation regularization problem (Q6108976) (← links)
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems (Q6110456) (← 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)
- Direct nonlinear acceleration (Q6114957) (← links)
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence (Q6116237) (← links)
- FISTA is an automatic geometrically optimized algorithm for strongly convex functions (Q6120847) (← links)
- Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems (Q6130542) (← links)
- Optimal Algorithms for Stochastic Complementary Composite Minimization (Q6136660) (← links)
- N-mode minimal tensor extrapolation methods (Q6140891) (← links)
- A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems (Q6145571) (← links)