Self-concordance is NP-hard
From MaRDI portal
Publication:1675557
DOI10.1007/s10898-016-0469-6zbMath1408.90244arXiv1303.7455OpenAlexW1571786812MaRDI QIDQ1675557
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.7455
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On cones of nonnegative quartic forms
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- A new line-search step based on the Weierstrass \(\wp\)-function for minimizing a class of logarithmic barrier functions
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Reducibility among Combinatorial Problems
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Norm attaining polynomials
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Most Tensor Problems Are NP-Hard
- Über homogene Polynome in ($L^{2}$)
This page was built for publication: Self-concordance is NP-hard
