An extragradient-based alternating direction method for convex minimization (Q525598)

scientific article

Language	Label	Description	Also known as
English	An extragradient-based alternating direction method for convex minimization	scientific article

Statements

instance of

scholarly article

0 references

title

An extragradient-based alternating direction method for convex minimization (English)

0 references

published in

Foundations of Computational Mathematics

0 references

publication date

5 May 2017

0 references

full work available at URL

https://arxiv.org/abs/1301.6308

0 references

zbMATH Keywords

alternating direction method

0 references

extragradient

0 references

iteration complexity

0 references

lasso

0 references

fused logistic regression

0 references

0 references

0 references

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q3096116

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

An alternating extragradient method for total variation-based image restoration from Poisson data

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

Robust principal component analysis?

0 references

Rank-Sparsity Incoherence for Matrix Decomposition

0 references

Fixed point and Bregman iterative methods for matrix rank minimization

0 references

On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables

0 references

A practical relative error criterion for augmented Lagrangians

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

Q3038523

0 references

Sparse inverse covariance estimation with the graphical lasso

0 references

On the information-adaptive variants of the ADMM: an iteration complexity perspective

0 references

Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction

0 references

Q3995612

0 references

The Split Bregman Method for L1-Regularized Problems

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

A new inexact alternating directions method for monotone variational inequalities

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

Q4110807

0 references

Q3330981

0 references

On the sublinear convergence rate of multi-block ADMM

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Alternating direction augmented Lagrangian methods for semidefinite programming

0 references

Alternating direction method of multipliers for sparse principal component analysis

0 references

On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

0 references

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

0 references

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers

0 references

Application of a Smoothing Technique to Decomposition in Convex Optimization

0 references

Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

0 references

Smooth minimization of non-smooth functions

0 references

New extragradient-type methods for general variational inequalities.

0 references

The Numerical Solution of Parabolic and Elliptic Differential Equations

0 references

Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function

0 references

Parallel coordinate descent methods for big data optimization

0 references

Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization

0 references

A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator

0 references

Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations

0 references

Q4864293

0 references

Sparsity and Smoothness Via the Fused Lasso

0 references

Path-following gradient-based decomposition algorithms for separable convex optimization

0 references

A New Alternating Minimization Algorithm for Total Variation Image Reconstruction

0 references

Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization

0 references

Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing

0 references

Split Bregman method for large scale fused Lasso

0 references

Model selection and estimation in the Gaussian graphical model

0 references

Alternating direction method for covariance selection models

0 references

Identifiers

zbMATH Open document ID

1364.90259

0 references

DOI

10.1007/s10208-015-9282-8

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:525598