A parameterized proximal point algorithm for separable convex optimization
From MaRDI portal
Publication:1800446
DOI10.1007/s11590-017-1195-9zbMath1407.90250arXiv1812.03759OpenAlexW2754227567MaRDI QIDQ1800446
Jianchao Bai, Hongchao Zhang, Ji-Cheng Li
Publication date: 23 October 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.03759
Related Items
General parameterized proximal point algorithm with applications in statistical learning ⋮ Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis ⋮ A generalized forward-backward splitting operator: degenerate analysis and applications ⋮ Approximate customized proximal point algorithms for separable convex optimization ⋮ Regularized quasi-monotone method for stochastic optimization ⋮ The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis ⋮ Strongly convergent inertial proximal point algorithm without on-line rule ⋮ Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers ⋮ Convergence results of two-step inertial proximal point algorithm ⋮ An inexact ADMM with proximal-indefinite term and larger stepsize
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- 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
- Proximal algorithms for multicomponent image recovery problems
- Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- A proximal point algorithm revisit on the alternating direction method of multipliers
- A customized proximal point algorithm for convex minimization with linear constraints
- Atomic Decomposition by Basis Pursuit
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- Robust principal component analysis?
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Modified Lagrangians in convex programming and their generalizations
- Proximal Methods for Cohypomonotone Operators
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION
- A proximal partially parallel splitting method for separable convex programs
- Proximité et dualité dans un espace hilbertien
This page was built for publication: A parameterized proximal point algorithm for separable convex optimization
