Proximal methods with Bregman distances to solve VIP on Hadamard manifolds with null sectional curvature

DOI10.1007/s40305-020-00311-yzbMath1488.90210OpenAlexW3048438815MaRDI QIDQ2059160

Erik Alex Papa Quiroz, Paulo Roberto Oliveira

Publication date: 13 December 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-020-00311-y

zbMATH Keywords

Bregman distancesHadamard manifoldsvariational inequality problemsproximal point methodsmonotone vector field

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• What do `convexities' imply on Hadamard manifolds?
• Existence of solutions for variational inequalities on Riemannian manifolds
• On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
• Rate of convergence for proximal point algorithms on Hadamard manifolds
• Variational inequalities on Hadamard manifolds
• Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
• Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
• Variational Inequalities for Set-Valued Vector Fields on Riemannian Manifolds: Convexity of the Solution Set and the Proximal Point Algorithm
• Monotone vector fields and the proximal point algorithm on Hadamard manifolds
• Proximal Point Algorithm On Riemannian Manifolds
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proximal methods with Bregman distances to solve VIP on Hadamard manifolds with null sectional curvature