"The computational complexity of finding stationary points in non-convex ..."

Alexandros Hollender, Manolis Zampetakis (2025)

> Home

Details and statistics

DOI: 10.1007/S10107-024-02139-3

access: closed

type: Journal Article

metadata version: 2025-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/HollenderZ25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/HollenderZ25
Alexandros Hollender, Manolis Zampetakis:
The computational complexity of finding stationary points in non-convex optimization. Math. Program. 213(1): 281-341 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.