Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size
DOI10.1080/00207160.2019.1656806zbMath1480.65149OpenAlexW2968735906WikidataQ127373555 ScholiaQ127373555MaRDI QIDQ5030635
Yuncheng Liu, Ke Guo, Mei-Jia Yang
Publication date: 17 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2019.1656806
convex programmingPeaceman-Rachford splitting methodlogarithmic-quadratic proximal regularizationlarger step-size
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A logarithmic-quadratic proximal method for variational inequalities
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- An LQP-based two-step method for structured variational inequalities
- Modified descent-projection method for solving variational inequalities
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Matrix completion via an alternating direction method
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A hybrid LQP-based method for structured variational inequalities
- On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
- A Generalized Proximal Point Algorithm and Its Convergence Rate
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- Convex analysis and monotone operator theory in Hilbert spaces
- Entropic proximal decomposition methods for convex programs and variational inequalities
This page was built for publication: Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size
