Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
From MaRDI portal
Publication:2968178
first-order methodsregularizationalternating direction method of multipliershybrid proximal extragradient methodinexact proximal point methodconvex programpointwise iteration-complexitynon-Euclidean Bregman distances
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60) Monotone operators and generalizations (47H05) Variational and other types of inclusions (47J22) Decomposition methods (49M27)
Cites work
- scientific article; zbMATH DE number 3852340 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1306968 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A monotone+skew splitting model for composite monotone inclusions in duality
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
- An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- An accelerated linearized alternating direction method of multipliers
- An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- Convex Analysis
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Enlargement of monotone operators with applications to variational inequalities
- Fast alternating direction optimization methods
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Hankel matrix rank minimization with applications to system identification and realization
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
- On the maximal monotonicity of subdifferential mappings
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
- Solving coupled composite monotone inclusions by successive Fejér approximations of their Kuhn-Tucker set
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
- Variational Analysis
Cited in
(15)- Cauchy noise removal by nonconvex ADMM with convergence guarantees
- Iteration-complexity analysis of a generalized alternating direction method of multipliers
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- 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
- Tikhonov-like methods with inexact minimization for solving linear ill-posed problems
- On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize
- A simple alternating direction method for the conic trust region subproblem
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
- A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers
- A survey on some recent developments of alternating direction method of multipliers
- Improved pointwise iteration-complexity of a regularized ADMM and of a regularized non-Euclidean HPE framework
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
This page was built for publication: Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968178)
