Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis

DOI10.1016/J.APNUM.2019.08.008MaRDI QIDQ2010228zbMATH OpenOpenAlexWikidataFDO

Authors Ke Guo, Deren Han

Publication date 27 November 2019

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apnum.2019.08.008

zbMATH Keywords

variational inequalitylinear convergenceworst-case convergence ratenonsymmetric proximal point algorithm

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A class of nonlinear proximal point algorithms for variational inequality problems
• A proximal point algorithm with asymmetric linear term
• scientific article; zbMATH DE number 6179220
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• The PPA-based numerical algorithm with the \(O(1/t)\) convergence rate for variant variational inequalities

Cites work

• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• scientific article; zbMATH DE number 3309655 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• A family of variable metric proximal methods
• A generalized proximal point algorithm and its convergence rate
• A generalized proximal point algorithm for certain non-convex minimization problems
• A logarithmic-quadratic proximal method for variational inequalities
• A new accuracy criterion for approximate proximal point algorithms
• A new inexact alternating directions method for monotone variational inequalities
• A proximal point algorithm revisit on the alternating direction method of multipliers
• A proximal point algorithm with asymmetric linear term
• A variable-penalty alternating directions method for convex optimization
• Alternating direction method with Gaussian back substitution for separable convex programming
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• An improved first-order primal-dual algorithm with a new correction step
• Computing stationary points
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
• Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
• Convergence of Proximal-Like Algorithms
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Inexact alternating direction methods for image recovery
• Inexact proximal point methods for variational inequality problems
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Interior projection-like methods for monotone variational inequalities
• Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs
• Modified Lagrangians in convex programming and their generalizations
• Monotone Operators and the Proximal Point Algorithm
• Multiplier and gradient methods
• New Proximal Point Algorithms for Convex Minimization
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• On the global and linear convergence of the generalized alternating direction method of multipliers
• On the linear convergence of the alternating direction method of multipliers
• On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Proximal-point algorithm using a linear proximal term
• Proximité et dualité dans un espace hilbertien
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Splitting Algorithms for the Sum of Two Nonlinear Operators

Cited in

(1)

• The developments of proximal point algorithms

This page was built for publication: Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010228)