Perseus: a simple and optimal high-order method for variational inequalities (Q6665392)

scientific article; zbMATH DE number 7969258

Language	Label	Description	Also known as
English	Perseus: a simple and optimal high-order method for variational inequalities	scientific article; zbMATH DE number 7969258

Statements

instance of

scholarly article

0 references

title

Perseus: a simple and optimal high-order method for variational inequalities (English)

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

17 January 2025

0 references

zbMATH Keywords

variational inequality

0 references

simple and optimal high-order method

0 references

acceleration

0 references

iteration complexity

0 references

local superlinear convergence

0 references

MaRDI profile type

Publication

0 references

cites work

Oracle complexity of second-order methods for smooth convex optimization

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models

0 references

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

0 references

Characterizations of pseudomonotone maps and economic equilibrium

0 references

Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities

0 references

Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step

0 references

Lower bounds for finding stationary points I

0 references

Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy

0 references

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives

0 references

Prediction, Learning, and Games

0 references

Accelerated schemes for a class of variational inequalities

0 references

Product Positioning Under Price Competition

0 references

On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators

0 references

The complexity of constrained min-max optimization

0 references

Local convergence of tensor methods

0 references

Cournot games with biconcave demand

0 references

Adaptive restart of accelerated gradient methods under local quadratic growth condition

0 references

New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure

0 references

Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems

0 references

Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms

0 references

Solving the Trust-Region Subproblem using the Lanczos Method

0 references

On solving trust-region and other regularised subproblems in optimization

0 references

Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians

0 references

Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions

0 references

Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives

0 references

On inexact solution of auxiliary problems in tensor methods for convex optimization

0 references

Adaptive Third-Order Methods for Composite Convex Optimization

0 references

Generalized Descent Methods for Asymmetric Systems of Equations

0 references

Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

0 references

On some non-linear elliptic differential functional equations

0 references

Cubic regularized Newton method for the saddle point models: a global and local convergence analysis

0 references

Extragradient Method with Variance Reduction for Stochastic Variational Inequalities

0 references

A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization

0 references

Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants

0 references

An Introduction to Variational Inequalities and Their Applications

0 references

Q4110807

0 references

Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation

0 references

An optimal randomized incremental gradient method

0 references

Random Gradient Extrapolation for Distributed and Stochastic Optimization

0 references

Equilibrium Points of Bimatrix Games

0 references

A control-theoretic perspective on optimal high-order optimization

0 references

Monotone Inclusions, Acceleration, and Closed-Loop Control

0 references

Q5159451

0 references

A unifying geometric solution framework and complexity analysis for variational inequalities

0 references

Averaging Schemes for Variational Inequalities and Systems of Equations

0 references

The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms

0 references

Solving variational inequality and fixed point problems by line searches and potential optimization

0 references

Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods

0 references

On High-order Model Regularization for Constrained Optimization

0 references

Learning in games with continuous action sets and unknown payoff functions

0 references

Monotone (nonlinear) operators in Hilbert space

0 references

Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems

0 references

On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

0 references

Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems

0 references

Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems

0 references

An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods

0 references

Linear convergence of first order methods for non-strongly convex optimization

0 references

Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

0 references

Optimal methods of smooth convex minimization

0 references

Dual extrapolation and its applications to solving variational inequalities and related problems

0 references

Accelerating the cubic regularization of Newton's method on convex problems

0 references

Gradient methods for minimizing composite functions

0 references

Lectures on convex optimization

0 references

Implementable tensor methods in unconstrained convex optimization

0 references

Inexact accelerated high-order proximal-point methods

0 references

Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure

0 references

Superfast second-order methods for unconstrained convex optimization

0 references

Cubic regularization of Newton method and its global performance

0 references

Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems

0 references

Adaptive restart for accelerated gradient schemes

0 references

A modification of the Arrow-Hurwicz method for search of saddle points

0 references

Q4353550

0 references

A simple nearly optimal restart scheme for speeding up first-order methods

0 references

The Approximation of Fixed Points of a Continuous Mapping

0 references

A New Projection Method for Variational Inequality Problems

0 references

Unified Acceleration of High-Order Algorithms under General Hölder Continuity

0 references

Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness

0 references

A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings

0 references

A variational perspective on accelerated methods in optimization

0 references

On lower iteration complexity bounds for the convex concave saddle point problems

0 references

Identifiers

DOI

10.1007/s10107-024-02075-2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6665392