Pages that link to "Item:Q3571748"
From MaRDI portal
The following pages link to A Coordinate Gradient Descent Method for Nonsmooth Nonseparable Minimization (Q3571748):
Displaying 13 items.
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems (Q908377) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Grouped coordinate minimization using Newton's method for inexact minimization in one vector coordinate (Q1321123) (← links)
- A coordinate descent method for total variation minimization (Q1992568) (← links)
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization (Q2465768) (← links)
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization (Q2815509) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
- Synthesis of quantum circuits based on supervised learning and correlations (Q6550840) (← links)
