Proximal-like methods for convex minimization problems
From MaRDI portal
Recommendations
- Proximal Minimization Methods with Generalized Bregman Functions
- Convergence of Proximal-Like Algorithms
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Strong convergence of a proximal-based method for convex optimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Cited in
(10)- Proximal linearization methods for Schatten p-quasi-norm minimization
- scientific article; zbMATH DE number 1042861 (Why is no real title available?)
- Iterative methods for the elastography inverse problem of locating tumors
- Proximal-based pre-correction decomposition methods for structured convex minimization problems
- The prox-Tikhonov-like forward-backward method and applications
- Proximal methods for the elastography inverse problem of tumor identification using an equation error approach
- Proximal Methods in Vector Optimization
- scientific article; zbMATH DE number 5070317 (Why is no real title available?)
- New formulation with proximal point algorithm and proximal bundle methods for equilibrium problems
- Analysis of a class of proxy problems
This page was built for publication: Proximal-like methods for convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5702611)