A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming

DOI10.1287/moor.2014.0698zbMath1329.90106OpenAlexW2028690814MaRDI QIDQ3465935

Min Li, Xiao-Ming Yuan

Publication date: 29 January 2016

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2014.0698

zbMATH Keywords

convex programmingconvergence rateiteration complexityPeaceman-Rachford splitting methodlogarithmic-quadratic proximal regularization

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (14)

A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems ⋮ An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems ⋮ Solving total-variation image super-resolution problems via proximal symmetric alternating direction methods ⋮ Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes ⋮ The developments of proximal point algorithms ⋮ Multivariate Monotone Inclusions in Saddle Form ⋮ Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers ⋮ The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming ⋮ An LQP-based symmetric alternating direction method of multipliers with larger step sizes ⋮ Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix ⋮ Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming ⋮ Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Gradient methods for minimizing composite functions
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A logarithmic-quadratic proximal method for variational inequalities
• Interior projection-like methods for monotone variational inequalities
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• A Generalized Proximal Point Algorithm and Its Convergence Rate
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
• Entropic proximal decomposition methods for convex programs and variational inequalities

This page was built for publication: A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming