A proximal multiplier method for separable convex minimization
From MaRDI portal
Recommendations
- Convergence rate of a proximal multiplier algorithm for separable convex minimization
- A partial inexact proximal point method for separable convex programming
- A proximal-based deomposition method for compositions method for convex minimization problems
- Rescaling and stepsize selection in proximal methods using separable generalized distances
- A splitting method for separable convex programming
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new proximal decomposition algorithm for routing in telecommunication networks
- A proximal-based deomposition method for compositions method for convex minimization problems
- A splitting method for separable convex programming
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Applications of the method of partial inverses to convex programming: Decomposition
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of Proximal-Like Algorithms
- Entropic proximal decomposition methods for convex programs and variational inequalities
- Exact matrix completion via convex optimization
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Interior projection-like methods for monotone variational inequalities
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Matrix Completion From a Few Entries
- Nonlinear proximal decomposition method for convex programming
- Partial inverse of a monotone operator
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Proximal Minimization Methods with Generalized Bregman Functions
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(18)- A proximal augmented method for semidefinite programming problems
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Rescaling and stepsize selection in proximal methods using separable generalized distances
- Convergence rate of a proximal multiplier algorithm for separable convex minimization
- scientific article; zbMATH DE number 6719195 (Why is no real title available?)
- A proximal splitting method for separable convex programming and its application to compressive sensing
- scientific article; zbMATH DE number 1292040 (Why is no real title available?)
- Proximal-based pre-correction decomposition methods for structured convex minimization problems
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
- Splitting proximal with penalization schemes for additive convex hierarchical minimization problems
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- A revisit of Chen-Teboulle's proximal-based decomposition method
- An interior proximal method with proximal distances for quasimonotone equilibrium problems
- Lagrangian penalization scheme with parallel forward-backward splitting
- A proximal algorithm for constrained multiobjective minimization with quasiconvex functions
This page was built for publication: A proximal multiplier method for separable convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790892)
