A search-free \(O(1/k^{3/2})\) homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
type: Item
instance of: scholarly article
title: A search-free \(O(1/k^{3/2})\) homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
author: Maicon Marques Alves
author: Jean-Michel Pereira
author: B. F. Svaiter
published in: SIAM Journal on Optimization
publication date: 2024-10-22T00:00:00Z
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 47N10
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 49J40
zbMATH DE Number: 7930273
zbMATH Keywords: variational inequalities
zbMATH Keywords: monotone inclusions
zbMATH Keywords: proximal-Newton algorithm
zbMATH Keywords: iteration-complexity
MaRDI profile type: Publication
cites work: Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
cites work: Oracle complexity of second-order methods for smooth convex optimization
cites work: Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities
cites work: Enlargement of monotone operators with applications to variational inequalities
cites work: Q4868581
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: An Optimal High-Order Tensor Method for Convex Optimization
cites work: Monotone Inclusions, Acceleration, and Closed-Loop Control
cites work: On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
cites work: Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
cites work: An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
cites work: Lectures on convex optimization
cites work: Implementable tensor methods in unconstrained convex optimization
cites work: Q4324980
cites work: Accelerating the cubic regularization of Newton's method on convex problems
cites work: Cubic regularization of Newton method and its global performance
cites work: Solution of Sparse Indefinite Systems of Linear Equations
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: Variational Analysis
cites work: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
cites work: A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
DOI: 10.1137/23M1593000
description: scientific article; zbMATH DE number 7930273