Math 2.0

Resources / preprint

Finding Stationary Points under Higher-Order Smoothness: Trapping Algorithms and First-Order Lower Bounds TT9BA4VMTW

URIm2://res/TT9BA4VMTW
Kindpreprint
CreatorsHuanjian Zhou, Masashi Sugiyama, Taiji Suzuki
Date2026-10-02
MSC49-XX, 90-XX, 93-XX
Subjectsarxiv math.OC
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-02
IdsarXiv 2610.02791

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
\bf High-order line integrationstatementlemma 4.2arxiv
\bf Lazy trapping or descentstatementtheorem 5.2arxiv
\textbf{Smooth Reconstruction from Finite Evaluationsstatementlemma A.6arxiv
\bf Total gradient-query complexitystatementproposition C.6arxiv
3TDMCBK1SMstatementtheorem 1.2arxiv
\bf Geometry of the shared-root treestatementfact C.4arxiv
\textbf{One-Phase Hardness with Delayed Disclosurestatementlemma 6.9arxiv
\textbf{Interpolation Error and Stabilitystatementlemma A.4arxiv
\bf Lower bounds without gradient Lipschitznessstatementtheorem 6.5arxiv
\bf Fresh query complexitystatementproposition D.4arxiv
\bf Stationarity from an approximate modelstatementlemma 3.9arxiv
6YDDHR1MB8statementtheorem 1.4arxiv
\bf Constraintsproblemproblem 4arxiv
\bf{$p$-th order trapping via function value oraclestatementtheorem 3.1arxiv
\textbf{Function Reconstructionproblemproblem A.1arxiv
7Q7H6TGZNBstatementtheorem 1.1arxiv
\bf Stationarity certificationstatementlemma 6.11arxiv
91451TCD3Sstatementcorollary 6.3arxiv
\bf Fresh mass after adaptive preprocessingstatementlemma E.5arxiv
9N7DDF19EEstatementfact C.1arxiv
\bf Trapping-or-descent dichotomystatementlemma 5.3arxiv
\bf Lazy boundary-reuse complexitystatementproposition D.6arxiv
\textbf{Suboptimality under Model Errorstatementlemma A.9arxiv
\bf Triangular augmentation and response reconstructionstatementfact E.17arxiv
\bf Trapping-or-descent dichotomystatementlemma D.1arxiv
\bf Regularity and initial gapstatementlemma 6.12arxiv
\bf Sequential accumulationstatementlemma 6.10arxiv
\textbf{H\"older Taylor Remainderstatementlemma A.3arxiv
\textbf{Local Polynomial Reconstructionstatementproposition A.5arxiv
CVCR2YAV0Cdefinitiondefinitionarxiv
\bf Trapping implies existence of stationaritystatementlemma 3.5arxiv
\bf Phasewise delayed-input reductionstatementproposition E.7arxiv
\bf Unreachability and trapping functiondefinitiondefinition 3.4arxiv
\bf Correctness of terminal localizationstatementlemma 5.4arxiv
\textbf{Scalar Reconstruction from Vector Fieldsstatementlemma A.7arxiv
\bf Delayed-input Krylov representationstatementlemma E.3arxiv
\textbf{Approximate Global Minimization from Dataproblemproblem A.2arxiv
\bf Hyperrectanglesdefinitiondefinition 3.3arxiv
\bf \((p,\beta)\)-H\"older smoothnessdefinitiondefinition 2.1arxiv
K0FGW8EJE0statementfact B.1arxiv
\textbf{Global Minimization with a Known Termstatementtheorem A.10arxiv
\bf Adaptive block-Krylov liftingstatementlemma E.16arxiv
\bf Reconstruction and update certificatesstatementfact C.2arxiv
\bf Gradient-only terminal outputstatementlemma C.3arxiv
\bf Local derivative boundsstatementproposition E.9arxiv
\bf Accuracy of lazy reusestatementlemma D.5arxiv
\bf Randomized first-order lower boundstatementtheorem 6.1arxiv
\bf Fixed-time single-output exclusionstatementlemma E.6arxiv
\bf Replicated hard spectrumstatementlemma E.1arxiv
\bf Trapping or descentstatementtheorem 5.1arxiv
\bf Dimension-free aggregationstatementproposition E.10arxiv
\bf Outer-loop guaranteestatementproposition D.3arxiv
\textbf{Reconstruction from Gradient Datastatementcorollary A.8arxiv
SFFECRVJ5Fstatementtheorem 1.3arxiv
\bf Oracleproblemproblem 3arxiv
\bf Active-phase gradient separationstatementproposition E.8arxiv
\bf Higher-order gradient-only trappingstatementtheorem 4.1arxiv
WGPKE5PCD3statementlemma 3.6arxiv
\bf Randomnessproblemproblem 1arxiv
\bf Gradient queries in one iterationstatementlemma C.5arxiv
\bf Smoothnessproblemproblem 2arxiv

Catalogue records