Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
From MaRDI portal
Publication:4979868
DOI10.1137/130910774zbMath1291.90176OpenAlexW2042650576MaRDI QIDQ4979868
Publication date: 19 June 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130910774
augmented Lagrangiansnonsmooth convex minimizationprimal-dual methodsproximal method of multipliersefficiency estimatesalternating direction of multipliersnonasymptotic rate of convergence
Convex programming (90C25) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10)
Related Items (81)
Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems ⋮ Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints ⋮ Variational methods for normal integration ⋮ ADMM for monotone operators: convergence analysis and rates ⋮ Unnamed Item ⋮ Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization ⋮ On the ergodic convergence rates of a first-order primal-dual algorithm ⋮ Faster Lagrangian-Based Methods in Convex Optimization ⋮ A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming ⋮ A simplified view of first order methods for optimization ⋮ A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization ⋮ Non-convex split Feasibility problems: models, algorithms and theory ⋮ On the information-adaptive variants of the ADMM: an iteration complexity perspective ⋮ A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems ⋮ Golden Ratio Primal-Dual Algorithm with Linesearch ⋮ A proximal point analysis of the preconditioned alternating direction method of multipliers ⋮ A primal-dual algorithm framework for convex saddle-point optimization ⋮ Convergence Rate Analysis of Primal-Dual Splitting Schemes ⋮ The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector ⋮ Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis ⋮ A golden ratio proximal alternating direction method of multipliers for separable convex optimization ⋮ A new Lagrangian-based first-order method for nonconvex constrained optimization ⋮ Inertial-relaxed splitting for composite monotone inclusions ⋮ Unnamed Item ⋮ A revisit of Chen-Teboulle's proximal-based decomposition method ⋮ An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression ⋮ First-order methods for convex optimization ⋮ A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization ⋮ Generalizations of the proximal method of multipliers in convex optimization ⋮ The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis ⋮ Image restoration based on the minimized surface regularization ⋮ A proximal interior point algorithm with applications to image processing ⋮ A survey on operator splitting and decomposition of convex programs ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ An adaptive primal-dual framework for nonsmooth convex minimization ⋮ An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate ⋮ Fixing and extending some recent results on the ADMM algorithm ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ Convergence of the augmented decomposition algorithm ⋮ On the optimal linear convergence rate of a generalized proximal point algorithm ⋮ FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems ⋮ A primal-dual dynamical approach to structured convex minimization problems ⋮ An introduction to continuous optimization for imaging ⋮ Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ A golden ratio primal-dual algorithm for structured convex optimization ⋮ A simple algorithm for a class of nonsmooth convex-concave saddle-point problems ⋮ Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers ⋮ Image reconstruction by minimizing curvatures on image surface ⋮ On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints ⋮ On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting ⋮ An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI ⋮ The geometry of monotone operator splitting methods ⋮ An adaptive fixed-point proximity algorithm for solving total variation denoising models ⋮ An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm ⋮ Exact Lipschitz regularization of convex optimization problems ⋮ Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications ⋮ An extended golden ratio proximal alternating direction method of multipliers for separable convex optimization ⋮ Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond ⋮ Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming ⋮ Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence ⋮ A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization ⋮ Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization ⋮ Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis ⋮ The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints ⋮ Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms ⋮ Bregman primal-dual first-order method and application to sparse semidefinite programming ⋮ A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis ⋮ A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems ⋮ A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization ⋮ The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings ⋮ A modified primal-dual method with applications to some sparse recovery problems ⋮ On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize ⋮ Random minibatch subgradient algorithms for convex problems with functional constraints ⋮ A proximal-gradient algorithm for crystal surface evolution ⋮ Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM ⋮ GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
This page was built for publication: Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
