Self-concordance is NP-hard
Optimization and Control
2013-04-01 v1 Computational Complexity
Abstract
We give an elementary proof of a somewhat curious result, namely, that deciding whether a convex function is self-concordant is in general an intractable problem.
Cite
@article{arxiv.1303.7455,
title = {Self-concordance is NP-hard},
author = {Lek-Heng Lim},
journal= {arXiv preprint arXiv:1303.7455},
year = {2013}
}