A proximal alternating linearization method for minimizing the sum of two convex functions
From MaRDI portal
Publication:892779
DOI10.1007/S11425-015-4986-4zbMATH Open1325.90070OpenAlexW1966102749MaRDI QIDQ892779FDOQ892779
Authors: Wenxing Zhang, Xing-Ju Cai, Zehui Jia 
Publication date: 12 November 2015
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-015-4986-4
Recommendations
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Alternating proximal gradient method for convex minimization
- A proximal alternating linearization method for nonconvex optimization problems
- An approximate alternating linearization decomposition method
- A class of alternating linearization algorithms for nonsmooth convex optimization
Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Atomic Decomposition by Basis Pursuit
- Title not available (Why is that?)
- Smooth minimization of non-smooth functions
- Introductory lectures on convex optimization. A basic course.
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Multiplier and gradient methods
- Title not available (Why is that?)
- Application of the alternating direction method of multipliers to separable convex programming problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction method for covariance selection models
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An EM algorithm for wavelet-based image restoration
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- A new inexact alternating directions method for monotone variational inequalities
- Alternating proximal gradient method for convex minimization
- The linearized alternating direction method of multipliers for Dantzig selector
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Alternating direction method with Gaussian back substitution for separable convex programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Deblurring Images
- Title not available (Why is that?)
- On alternating direction methods of multipliers: a historical perspective
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
- Proximal Decomposition Via Alternating Linearization
Cited In (8)
- A linearized method for the separable convex programming with objective function represented as three functions
- Alternating proximal algorithm for the problem of bi-level convex minimization
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- A class of alternating linearization algorithms for nonsmooth convex optimization
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
- Alternating minimization algorithm for minimizing the sum of strongly convex function and weakly convex function
- Fast alternating linearization methods for minimizing the sum of two convex functions
- An extragradient-based alternating direction method for convex minimization
Uses Software
This page was built for publication: A proximal alternating linearization method for minimizing the sum of two convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892779)
