A proximal partially parallel splitting method for separable convex programs
From MaRDI portal
Publication:5268890
DOI10.1080/10556788.2016.1200044zbMATH Open1368.65091OpenAlexW2477365164MaRDI QIDQ5268890FDOQ5268890
Authors: Kai Wang, Jitamitra Desai, Hongjin He 
Publication date: 21 June 2017
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1200044
Recommendations
- A splitting method for separable convex programming
- scientific article; zbMATH DE number 6453677
- A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
- A parallel splitting method for separable convex programs
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
global convergencenumerical experimentparallel computationsplitting algorithmseparable convex optimization
Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Nonlinear programming (90C30)
Cites Work
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Sparsity and Smoothness Via the Fused Lasso
- Gradient methods for minimizing composite functions
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
- Multiplier and gradient methods
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Monotone Operators and the Proximal Point Algorithm
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Alternating direction method with Gaussian back substitution for separable convex programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- A note on the alternating direction method of multipliers
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- A splitting method for separable convex programming
- A descent method for structured monotone variational inequalities
- A note on augmented Lagrangian-based parallel splitting method
- A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
- Structured linear algebra problems in adaptive optics imaging
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
- A partial splitting augmented Lagrangian method for low patch-rank image decomposition
Cited In (19)
- Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming
- A parallel splitting method for separable convex programs
- An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems
- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
- A proximal fully parallel splitting method for stable principal component pursuit
- A parameterized proximal point algorithm for separable convex optimization
- Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
- A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems
- A parallel splitting ALM-based algorithm for separable convex programming
- A splitting primal-dual proximity algorithm for solving composite optimization problems
- On the convergence rate of the augmented Lagrangian-based parallel splitting method
- Splitting proximal with penalization schemes for additive convex hierarchical minimization problems
- A proximal fully parallel splitting method with a relaxation factor for separable convex programming
- A new alternating projection-based prediction–correction method for structured variational inequalities
- A proximal splitting method for separable convex programming and its application to compressive sensing
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
- Title not available (Why is that?)
- Sensitivity analysis of the proximal-based parallel decomposition methods
This page was built for publication: A proximal partially parallel splitting method for separable convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268890)
