The following pages link to (Q5153443):
Displaying 32 items.
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- Fast proximity-gradient algorithms for structured convex optimization problems (Q739473) (← links)
- A preconditioning proximal Newton method for nondifferentiable convex optimization (Q1356053) (← links)
- A new method for nonsmooth convex optimization (Q1386698) (← links)
- Approximate Rolle's theorems for the proximal subgradient and the generalized gradient. (Q1404904) (← links)
- A modified proximal gradient method for a family of nonsmooth convex optimization problems (Q1697903) (← links)
- The gradient projection algorithm for smooth sets and functions in nonconvex case (Q2045187) (← links)
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method (Q2046546) (← links)
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
- A class of line search-type methods for nonsmooth convex regularized minimization (Q2098339) (← links)
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity (Q2115253) (← links)
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
- Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces (Q2256391) (← links)
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM (Q2279378) (← links)
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
- An efficient primal dual prox method for non-smooth optimization (Q2339936) (← links)
- On the proximal Landweber Newton method for a class of nonsmooth convex problems (Q2340491) (← links)
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm (Q2442634) (← links)
- A proximal ADMM with the Broyden family for convex optimization problems (Q2666686) (← links)
- An inexact Riemannian proximal gradient method (Q2701414) (← links)
- Gradient-proximal method of solving of extreme inclusions (Q2722322) (← links)
- (Q2984432) (← links)
- Proximal gradient method with automatic selection of the parameter by automatic differentiation (Q4685565) (← links)
- (Q5149020) (← links)
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems (Q5231666) (← links)
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization (Q5268471) (← links)
- (Q5269141) (← links)
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization (Q6110439) (← links)
