General parameterized proximal point algorithm with applications in statistical learning
From MaRDI portal
Publication:5031803
DOI10.1080/00207160.2018.1427854zbMath1499.90192arXiv1812.03763OpenAlexW3168964334MaRDI QIDQ5031803
Ping-Fan Dai, Jiao-Fen Li, Jianchao Bai, Ji-Cheng Li
Publication date: 16 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.03763
Related Items
Uses Software
Cites Work
- Unnamed Item
- Sparse inverse covariance estimation with the graphical lasso
- Latent variable graphical model selection via convex optimization
- Analysis of convergence for the alternating direction method applied to joint sparse recovery
- 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 parameterized proximal point algorithm for separable convex optimization
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- Alternating proximal gradient method for convex minimization
- A proximal point algorithm revisit on the alternating direction method of multipliers
- A customized proximal point algorithm for convex minimization with linear constraints
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION
- A splitting method for separable convex programming
- Proximité et dualité dans un espace hilbertien
