Convergence rate of a proximal multiplier algorithm for separable convex minimization
From MaRDI portal
Publication:2970394
DOI10.1080/02331934.2016.1261138zbMath1366.90165MaRDI QIDQ2970394
E. A. Papa Quiroz, Orlando Sarmiento, Paulo Roberto Oliveira
Publication date: 30 March 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1261138
convex functionsproximal distanceslinear rate of convergenceseparable convex problemsproximal multiplier methods
90C25: Convex programming
Related Items
Unnamed Item, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
Cites Work
- 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
- Double-regularization proximal methods, with complementarity applications
- Interior projection-like methods for monotone variational inequalities
- A proximal multiplier method for separable convex minimization
- Inexact Proximal Point Methods for Variational Inequality Problems
- 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
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A new proximal decomposition algorithm for routing in telecommunication networks
- A splitting method for separable convex programming
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Entropic proximal decomposition methods for convex programs and variational inequalities
