Self-concordance is NP-hard (Q1675557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1303.7455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of deciding convexity of quartic polynomials and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über homogene Polynome in ($L^{2}$) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimizing over a simplex, hypercube or sphere: a short survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most Tensor Problems Are NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cones of nonnegative quartic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new line-search step based on the Weierstrass \(\wp\)-function for minimizing a class of logarithmic barrier functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm attaining polynomials / rank
 
Normal rank

Latest revision as of 16:34, 14 July 2024

scientific article
Language Label Description Also known as
English
Self-concordance is NP-hard
scientific article

    Statements

    Self-concordance is NP-hard (English)
    0 references
    0 references
    2 November 2017
    0 references
    0 references
    self-concordance
    0 references
    second-order self-concordance
    0 references
    NP-hard
    0 references
    co-NP-hard
    0 references
    0 references
    0 references