Fast Multiple-Splitting Algorithms for Convex Optimization
From MaRDI portal
Publication:2910883
DOI10.1137/090780705zbMath1254.65075arXiv0912.4570OpenAlexW1966881087MaRDI QIDQ2910883
Publication date: 12 September 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.4570
convex optimizationdecompositionnumerical examplesparallel computingsmoothing techniquesaugmented Lagrangian methodcomplexity theoryproximal point algorithmalternating linearization methodoptimal gradient methodvariable splittingalternating direction
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20)
Related Items
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints, An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing, Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems, On the global and linear convergence of the generalized alternating direction method of multipliers, Alternating proximal gradient method for convex minimization, Accelerated Bregman operator splitting with backtracking, Fast alternating linearization methods for minimizing the sum of two convex functions, iPiasco: inertial proximal algorithm for strongly convex optimization, An operator-splitting approach for variational optimal control formulations for diffeomorphic shape matching, Inexact alternating direction methods of multipliers for separable convex optimization, Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties, Alternating direction augmented Lagrangian methods for semidefinite programming, Decomposable Markov Decision Processes: A Fluid Optimization Approach, A linear algebra perspective on the random multi-block ADMM: the QP case, Accelerated linearized Bregman method, A survey on operator splitting and decomposition of convex programs, Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection, Alternating direction method of multipliers for sparse principal component analysis, Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing, Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property, An alternating direction method of multipliers for tensor complementarity problems, On the linear convergence of the alternating direction method of multipliers, An introduction to continuous optimization for imaging, Convergence rates for an inexact ADMM applied to separable convex optimization, Diffeomorphic shape matching by operator splitting in 3D cardiology imaging, Fast inexact decomposition algorithms for large-scale separable convex optimization, On the Global Linear Convergence of the ADMM with MultiBlock Variables, Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization, Mirror Prox algorithm for multi-term composite minimization and semi-separable problems, Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
