A search-free \(O(1/k^{3/2})\) homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
DOI10.1137/23m1593000MaRDI QIDQ6622750
M. Marques Alves, B. F. Svaiter, Jean-Michel Pereira
Publication date: 22 October 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Large-scale problems in mathematical programming (90C06) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Newton-type methods (49M15) Methods of quasi-Newton type (90C53) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on convex optimization
- Accelerating the cubic regularization of Newton's method on convex problems
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Implementable tensor methods in unconstrained convex optimization
- Oracle complexity of second-order methods for smooth convex optimization
- Cubic regularization of Newton method and its global performance
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Solution of Sparse Indefinite Systems of Linear Equations
- Variational Analysis
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- An Optimal High-Order Tensor Method for Convex Optimization
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
- Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities
- Monotone Inclusions, Acceleration, and Closed-Loop Control
This page was built for publication: A search-free \(O(1/k^{3/2})\) homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622750)
