Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2008.05558
Cited By
v1
v2
v3
v4
v5 (latest)
On the complexity of finding a local minimizer of a quadratic function over a polytope
Mathematical programming (Math. Program.), 2020
12 August 2020
Amir Ali Ahmadi
Jeffrey O. Zhang
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"On the complexity of finding a local minimizer of a quadratic function over a polytope"
7 / 7 papers shown
Adaptive Conditional Gradient Descent
Abbas Khademi
Antonio Silveti-Falls
117
3
0
13 Oct 2025
SoS1: O1 and R1-Like Reasoning LLMs are Sum-of-Square Solvers
Kechen Li
Wenqi Zhu
Coralia Cartis
Tianbo Ji
Shiwei Liu
ReLM
LRM
275
3
0
27 Feb 2025
On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization
Guy Kornowski
Swati Padmanabhan
Ohad Shamir
968
1
0
16 Sep 2024
Higher-Order Newton Methods with Polynomial Work per Iteration
Advances in Mathematics (Adv. Math.), 2023
Amir Ali Ahmadi
A. Chaudhry
Jeffrey O. Zhang
299
13
0
10 Nov 2023
Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms
Lai Tian
Anthony Man-Cho So
277
2
0
23 Feb 2023
The Complexity of Gradient Descent: CLS = PPAD
∩
\cap
∩
PLS
John Fearnley
P. Goldberg
Alexandros Hollender
Rahul Savani
294
93
0
03 Nov 2020
Complexity aspects of local minima and related notions
Amir Ali Ahmadi
Jeffrey O. Zhang
181
13
0
14 Aug 2020
1
Page 1 of 1