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

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
1 Online-Ressource.
Language
Englisch

Bibliographic citation
The computational complexity of finding stationary points in non-convex optimization ; day:27 ; month:9 ; year:2024 ; pages:1-61
Mathematical programming ; (27.9.2024), 1-61

Creator
Hollender, Alexandros
Zampetakis, Manolis
Contributor
SpringerLink (Online service)

DOI
10.1007/s10107-024-02139-3
URN
urn:nbn:de:101:1-2412132100325.808404272321
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
15.08.2025, 7:34 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Hollender, Alexandros
  • Zampetakis, Manolis
  • SpringerLink (Online service)

Other Objects (12)