Self-concordance is NP-hard

Lek-Heng Lim ()
Additional contact information
Lek-Heng Lim: University of Chicago

Journal of Global Optimization, 2017, vol. 68, issue 2, No 6, 357-366

Abstract: Abstract We show that deciding whether a convex function is self-concordant is in general an intractable problem.

Keywords: Self-concordance; Second-order self-concordance; NP-hard; Co-NP-hard (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-016-0469-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:68:y:2017:i:2:d:10.1007_s10898-016-0469-6

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-016-0469-6

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().