Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
From MaRDI portal
Publication:5300535
DOI10.1137/110849468zbMath1267.90181OpenAlexW2094631364MaRDI QIDQ5300535
Renato D. C. Monteiro, Benar Fux Svaiter
Publication date: 27 June 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/93e211db41f4faa8496e69ed0db0c77ff8be45a4
Numerical mathematical programming methods (65K05) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Decomposition methods (49M27) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error, A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates, Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, A survey on some recent developments of alternating direction method of multipliers, On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming, A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities, Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems, Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers, Accelerated gradient sliding for structured convex optimization, Iteration-complexity analysis of a generalized alternating direction method of multipliers, A proximal block minimization method of multipliers with a substitution procedure, Faster Lagrangian-Based Methods in Convex Optimization, An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems, Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity, Unnamed Item, Alternating proximal gradient method for convex minimization, Global convergence of unmodified 3-block ADMM for a class of convex minimization problems, On the information-adaptive variants of the ADMM: an iteration complexity perspective, Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor, Accelerated Bregman operator splitting with backtracking, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, A proximal point analysis of the preconditioned alternating direction method of multipliers, On the sublinear convergence rate of multi-block ADMM, A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, Projective method of multipliers for linearly constrained convex minimization, A first-order block-decomposition method for solving two-easy-block structured semidefinite programs, On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, Complexity analysis of a stochastic variant of generalized alternating direction method of multipliers, \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers, Robust multicategory support matrix machines, Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming, An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization, Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems, Resolvent splitting for sums of monotone operators with minimal lifting, A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization, Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework, A two-level distributed algorithm for nonconvex constrained optimization, First-order algorithms for convex optimization with nonseparable objective and coupled constraints, Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems, Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming, An adaptive primal-dual framework for nonsmooth convex minimization, Tikhonov-like methods with inexact minimization for solving linear ill-posed problems, An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate, A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application, Generalized Peaceman-Rachford splitting method with substitution for convex programming, On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm, Convergent prediction-correction-based ADMM for multi-block separable convex programming, Local linear convergence of an ADMM-type splitting framework for equality constrained optimization, On the linear convergence of the alternating direction method of multipliers, Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization, An extragradient-based alternating direction method for convex minimization, Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces, Convergence rates for an inexact ADMM applied to separable convex optimization, ON THE CONVERGENCE RATE OF THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS IN A COMPLEX DOMAIN, Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems, Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator, A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems, Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers, A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization, An extended proximal ADMM algorithm for three-block nonconvex optimization problems, An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm, Interior hybrid proximal extragradient methods for the linear monotone complementarity problem, Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach, Communication-efficient algorithms for decentralized and stochastic optimization, Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates, On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Randomized primal-dual proximal block coordinate updates, Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations, A regularized alternating direction method of multipliers for a class of nonconvex problems, An ADMM-based SQP method for separably smooth nonconvex optimization, A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis, Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions, Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems, On the Global Linear Convergence of the ADMM with MultiBlock Variables, A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization, An Accelerated Linearized Alternating Direction Method of Multipliers, Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds, On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize, LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM, A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance, An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems, Mirror Prox algorithm for multi-term composite minimization and semi-separable problems, A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
