Pages that link to "Item:Q2133414"
From MaRDI portal
The following pages link to Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414):
Displaying 13 items.
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- Incremental without replacement sampling in nonconvex optimization (Q2046568) (← links)
- On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
- Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization (Q2848188) (← links)
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems (Q6155872) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- An interior proximal gradient method for nonconvex optimization (Q6584340) (← links)
- On the convergence of broadcast incremental algorithms with applications (Q6612687) (← links)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
- Convergence properties of proximal (sub)gradient methods without convexity or smoothness of any of the functions (Q6663109) (← links)
