The Computational Complexity of Finding Stationary Points in Non-Convex Optimization

Alexandros Hollender, Emmanouil Zampetakis. The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. In Gergely Neu, Lorenzo Rosasco, editors, The Thirty Sixth Annual Conference on Learning Theory, 12-15 July 2023, Bangalore, India. Volume 195 of Proceedings of Machine Learning Research, pages 5571-5572, PMLR, 2023. [doi]

@inproceedings{HollenderZ23,
  title = {The Computational Complexity of Finding Stationary Points in Non-Convex Optimization},
  author = {Alexandros Hollender and Emmanouil Zampetakis},
  year = {2023},
  url = {https://proceedings.mlr.press/v195/hollender23a.html},
  researchr = {https://researchr.org/publication/HollenderZ23},
  cites = {0},
  citedby = {0},
  pages = {5571-5572},
  booktitle = {The Thirty Sixth Annual Conference on Learning Theory, 12-15 July 2023, Bangalore, India},
  editor = {Gergely Neu and Lorenzo Rosasco},
  volume = {195},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}