A proximal alternating linearization method for minimizing the sum of two convex functions
From MaRDI portal
(Redirected from Publication:892779)
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
Cites work
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction method for covariance selection models
- Alternating direction method with Gaussian back substitution for separable convex programming
- Alternating proximal gradient method for convex minimization
- An EM algorithm for wavelet-based image restoration
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Application of the alternating direction method of multipliers to separable convex programming problems
- Atomic Decomposition by Basis Pursuit
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
- Deblurring Images
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exact matrix completion via convex optimization
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Introductory lectures on convex optimization. A basic course.
- Multiplier and gradient methods
- On alternating direction methods of multipliers: a historical perspective
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal Decomposition Via Alternating Linearization
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Smooth minimization of non-smooth functions
- The linearized alternating direction method of multipliers for Dantzig selector
Cited in
(9)- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
- 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
- Alternating proximal algorithm for the problem of bi-level convex minimization
- Fast alternating linearization methods for minimizing the sum of two convex functions
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- An extragradient-based alternating direction method for convex minimization
- A class of alternating linearization algorithms for nonsmooth convex optimization
- A linearized method for the separable convex programming with objective function represented as three functions
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)
