On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
From MaRDI portal
(Redirected from Publication:5221273)
Recommendations
- On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Iteration-complexity analysis of a generalized alternating direction method of multipliers
- Convergence study on the proximal alternating direction method with larger step size
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
Cites work
- A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem
- 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 proximal Peaceman-Rachford splitting method for solving the multi-block separable convex minimization problems
- A unified primal-dual algorithm framework based on Bregman iteration
- 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 extragradient-based alternating direction method for convex minimization
- 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
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Convergence study on the symmetric version of ADMM with larger step sizes
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Hankel matrix rank minimization with applications to system identification and realization
- 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?)
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Monotone Operators and the Proximal Point Algorithm
- 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 global and linear convergence of the generalized alternating direction method of multipliers
- On the maximal monotonicity of subdifferential mappings
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
- The linearized alternating direction method of multipliers for Dantzig selector
Cited in
(3)- On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- An inexact symmetric proximal ADMM with convex combination proximal centers for separable convex programming
This page was built for publication: On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221273)
