Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
From MaRDI portal
Publication:467471
DOI10.1007/S10957-013-0489-ZzbMath1322.90065OpenAlexW2012427950MaRDI QIDQ467471
Junfeng Yang, Guoyong Gu, Bing-sheng He
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0489-z
Related Items (5)
Efficient algorithms for solving condition number-constrained matrix minimization problems ⋮ Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms ⋮ An efficient method for solving a matrix least squares problem over a matrix inequality constraint ⋮ An inexact accelerated stochastic ADMM for separable convex optimization ⋮ An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
Cites Work
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- A new inexact alternating directions method for monotone variational inequalities
- Alternating direction method for covariance selection models
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Alternating Direction Method for Image Inpainting in Wavelet Domains
- The Split Bregman Method for L1-Regularized Problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Encyclopedia of Optimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Monotone Operators and the Proximal Point Algorithm
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Convergence of Proximal-Like Algorithms
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
