scientific article; zbMATH DE number 7404502
From MaRDI portal
Publication:5153443
Recommendations
- A modified proximal gradient method for a family of nonsmooth convex optimization problems
- A proximal iterative approach to a non-convex optimization problem
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
- Proximal point methods and nonconvex optimization
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- Fast proximal algorithms for nonsmooth convex optimization
- A proximal-like algorithm for a class of nonconvex programming
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- A proximal alternating linearization method for nonconvex optimization problems
Cited in
(40)- A preconditioning proximal Newton method for nondifferentiable convex optimization
- A new method for nonsmooth convex optimization
- Approximate Rolle's theorems for the proximal subgradient and the generalized gradient.
- A modified proximal gradient method for a family of nonsmooth convex optimization problems
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- A class of line search-type methods for nonsmooth convex regularized minimization
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
- Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- An efficient primal dual prox method for non-smooth optimization
- On the proximal Landweber Newton method for a class of nonsmooth convex problems
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- A proximal ADMM with the Broyden family for convex optimization problems
- An inexact Riemannian proximal gradient method
- Gradient-proximal method of solving of extreme inclusions
- scientific article; zbMATH DE number 6719195 (Why is no real title available?)
- A modified proximal gradient method and its convergence rate
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
- Proximal gradient method with automatic selection of the parameter by automatic differentiation
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- On the linear convergence of the proximal subgradient splitting method for weakly convex optimization problems
- Proximal-proximal-gradient method
- Decomposable norm minimization with proximal-gradient homotopy algorithm
- scientific article; zbMATH DE number 7306909 (Why is no real title available?)
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- scientific article; zbMATH DE number 6731404 (Why is no real title available?)
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- An inexact gradient mirror descent algorithm for non-smooth convex optimization
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
- A proximal sub-gradient method for group Lasso-type problems
- Fast proximity-gradient algorithms for structured convex optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5153443)
