Self-concordance is NP-hard

Self-concordance is NP-hard

0.00 Avg rating0 Votes
Article ID: iaor20171754
Volume: 68
Issue: 2
Start Page Number: 357
End Page Number: 366
Publication Date: Jun 2017
Journal: Journal of Global Optimization
Authors:
Keywords: programming: convex
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.