Pages that link to "Item:Q359630"
From MaRDI portal
The following pages link to Gradient methods for minimizing composite functions (Q359630):
Displaying 50 items.
- (Q5152050) (← links)
- Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems (Q5158768) (← links)
- (Q5159402) (← links)
- DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS (Q5174338) (← links)
- Finite element approximation of source term identification with TV-regularization (Q5204631) (← links)
- Sharpness, Restart, and Acceleration (Q5210521) (← links)
- (Q5214181) (← links)
- (Q5214241) (← links)
- Generalized Conjugate Gradient Methods for <i>ℓ</i><sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
- A Single-Phase, Proximal Path-Following Framework (Q5219702) (← links)
- On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (Q5219732) (← links)
- Imaging with highly incomplete and corrupted data (Q5220309) (← links)
- Composite Optimization by Nonconvex Majorization-Minimization (Q5230420) (← links)
- An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
- Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives (Q5231684) (← links)
- Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size (Q5232280) (← links)
- Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme (Q5236622) (← links)
- A scalable estimator of sets of integral operators (Q5236688) (← links)
- Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature (Q5237307) (← links)
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)
- 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)
- 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)
- 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)
