Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vaithilingam Jeyakumar / rank
Normal rank
 
Property / author
 
Property / author: Vaithilingam Jeyakumar / 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.1016/j.orl.2012.09.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052538354 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59241518 / 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: A Complete Characterization of the Gap between Convexity and SOS-Convexity / 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: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative polynomials and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new geometric condition for Fenchel's duality in infinite dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / 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: On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / 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: A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524522 / 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: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex sets with semidefinite representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of nonnegative convex polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Extension of Fenchel Duality and its Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming / rank
 
Normal rank

Latest revision as of 06:32, 6 July 2024

scientific article
Language Label Description Also known as
English
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
scientific article

    Statements

    Exact SDP relaxations for classes of nonlinear semidefinite programming problems (English)
    0 references
    0 references
    0 references
    5 March 2013
    0 references
    polynomial optimization
    0 references
    convex semi-definite programming
    0 references
    SOS-convex polynomials
    0 references
    sum of squares polynomials
    0 references
    fractional programs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers