A proximal multiplier method for separable convex minimization
From MaRDI portal
Publication:2790892
DOI10.1080/02331934.2015.1062009zbMath1338.52012OpenAlexW2181953721MaRDI QIDQ2790892
Orlando Sarmiento, E. A. Papa Quiroz, Paulo Roberto Oliveira
Publication date: 8 March 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2015.1062009
Related Items (4)
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ Convergence rate of a proximal multiplier algorithm for separable convex minimization ⋮ Unnamed Item ⋮ Lagrangian penalization scheme with parallel forward-backward splitting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Partial inverse of a monotone operator
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- Nonlinear proximal decomposition method for convex programming
- Interior projection-like methods for monotone variational inequalities
- Exact matrix completion via convex optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Applications of the method of partial inverses to convex programming: Decomposition
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- A new proximal decomposition algorithm for routing in telecommunication networks
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- A splitting method for separable convex programming
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Entropic proximal decomposition methods for convex programs and variational inequalities
This page was built for publication: A proximal multiplier method for separable convex minimization
