View in EDS HTML Full Text PDF Full Text

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

Saved in:
Bibliographic Details
Title: The computational complexity of finding stationary points in non-convex optimization.
Authors: Hollender, Alexandros1, alexandros.hollender@cs.ox.ac.uk, Zampetakis, Manolis2, emmanouil.zampetakis@yale.edu
Source: Mathematical Programming; Sep2025, Vol. 213 Issue 1/2, p281-341, 61p
Database: Applied Science & Technology Source
Full text is not displayed to guests.
Description
ISSN:00255610
DOI:10.1007/s10107-024-02139-3