Approximate customized proximal point algorithms for separable convex optimization
From MaRDI portal
Publication:6155528
DOI10.1007/s40305-022-00412-wzbMath1524.90246MaRDI QIDQ6155528
Lingling Xu, Xing-Ju Cai, Hongmei Chen
Publication date: 5 June 2023
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-022-00412-w
alternating direction method of multipliers; proximal point algorithm; separable convex programming; inexact criteria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- An inexact alternating direction method of multipliers with relative error criteria
- A class of customized proximal point algorithms for linearly constrained convex optimization
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Image recovery via total variation minimization and related problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Approximate ADMM algorithms derived from Lagrangian splitting
- On inexact ADMMs with relative error criteria
- A parameterized proximal point algorithm for separable convex optimization
- Inexact first-order primal-dual algorithms
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers
- A proximal point algorithm revisit on the alternating direction method of multipliers
- Multiplier and gradient methods
- A customized proximal point algorithm for convex minimization with linear constraints
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Singular Value Thresholding Algorithm for Matrix Completion
- Matrix completion via an alternating direction method
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
