Pith. sign in

REVIEW 1 cited by

Universal Tensor Methods for Monotone Variational Inequalities

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.07824 v3 pith:7JERKZ3P submitted 2022-12-15 math.OC

classification math.OC
keywords extragradienttensorepsilonmonotoneoldercontinuousinequalitiesmathcal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study monotone variational inequalities whose operators have H\"older continuous higher-order derivatives. For a fixed order $p\geq 2$, we assume that the $(p-1)$-th derivative of the monotone operator is H\"older continuous with parameter $\nu\in[0,1]$ on a bounded closed convex set. We develop regularized tensor extragradient methods that combine a high-order Taylor approximation of the operator with an extragradient correction step. When the H\"older parameter $\nu$ is known, our regularized tensor extragradient method finds an $\epsilon$-weak solution using $\mathcal{O}(\epsilon^{-2/(p+\nu)})$ tensor-oracle calls. When $\nu$ is unknown, we propose a universal tensor extragradient method whose tensor-oracle complexity is $\mathcal{O}(\epsilon^{-2p/((p+1)(p-1+\nu))})$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/7})$ Second-Order Oracle Complexity

    math.OC 2025-06 conditional novelty 7.0 of 10

    A new triple-loop algorithm, Minimax-AIPE, solves convex-concave minimax problems with tilde O(epsilon^{-4/7}) second-order oracle calls, improving the previous O(epsilon^{-2/3}).

Pith tools