Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59241424, #quickstatements; #temporary_batch_1708557319324
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-016-1023-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-016-1023-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2536872194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust SOS-convex polynomial optimization problems: exact SDP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of nonnegative convex polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in SemiAlgebraic Geometry and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact SDP relaxations for classes of nonlinear semidefinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: First and second order analysis of nonlinear semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Duality in Second Order and p -Order Cone Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Characterization of the Gap between Convexity and SOS-Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex polynomial that is not sos-convex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of alternative theorems for SOS-convex inequalities and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial optimization over non-compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Matrix Inequality and Semidefinite Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Optimization and Convex Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Frank--Wolfe type theorem for convex polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth vector functions and continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-016-1023-X / rank
 
Normal rank

Latest revision as of 19:59, 9 December 2024

scientific article
Language Label Description Also known as
English
Exact conic programming relaxations for a class of convex polynomial cone programs
scientific article

    Statements

    Exact conic programming relaxations for a class of convex polynomial cone programs (English)
    0 references
    23 February 2017
    0 references
    convex cone programs
    0 references
    convex polynomial optimization
    0 references
    conic programming
    0 references
    semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers