On the complexity of detecting convexity over a box (Q2191776): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-019-01396-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963961403 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1806.06173 / 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: On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Matrix Cube Theorems with Applications to μ-Theory in Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-Hardness of Some Linear Control Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Establishing Convexity of Polynomial Lyapunov Functions and Their Sublevel Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing mathematical programs using MProbe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4479208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2933946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of Multidimensional Convex Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several NP-hard problems arising in robust stability analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open questions in complexity theory for numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faithful variable screening for high-dimensional convex regression / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-019-01396-X / rank
 
Normal rank

Latest revision as of 10:21, 17 December 2024

scientific article
Language Label Description Also known as
English
On the complexity of detecting convexity over a box
scientific article

    Statements

    On the complexity of detecting convexity over a box (English)
    0 references
    0 references
    0 references
    26 June 2020
    0 references
    convexity detection
    0 references
    convex optimization
    0 references
    computational complexity
    0 references
    interval positive semidefiniteness
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references