An alternate minimization method beyond positive definite proximal regularization: convergence and complexity

DOI10.23952/jnva.3.2019.3.08zbMath1475.90116OpenAlexW4249085068MaRDI QIDQ5244153

Tao Zhang, Xiaoqing Ou, Jia-wei Chen, Shawn Xianfu Wang

Publication date: 20 November 2019

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.23952/jnva.3.2019.3.08

zbMATH Keywords

complexityconvex optimizationvariational inequalityalternate minimization methodpositive-indefinite proximal regularization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (4)

Unnamed Item ⋮ Self-adaptive inertial extragradient algorithms for solving variational inequality problems ⋮ A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application ⋮ A modified proximal point algorithm involving nearly asymptotically quasi-nonexpansive mappings

Uses Software

• RecPF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Auxiliary principle and algorithm for mixed equilibrium problems and bilevel mixed equilibrium problems in Banach spaces
• A unified primal-dual algorithm framework based on Bregman iteration
• A decomposition property for a class of square matrices
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A new inexact alternating directions method for monotone variational inequalities
• A note on the alternating direction method of multipliers
• An ADM-based splitting method for separable convex programming
• Strong convergence of an extragradient-like algorithm involving pseudo-monotone mappings
• Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
• Multiplier and gradient methods
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
• Alternating Direction Method for Image Inpainting in Wavelet Domains
• Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Asynchronous Distributed ADMM for Large-Scale Optimization—Part II: Linear Convergence Analysis and Numerical Performance
• Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization

This page was built for publication: An alternate minimization method beyond positive definite proximal regularization: convergence and complexity