Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2013.11.005 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1306.6419 / 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: Nonnegative polynomials and sums of squares / 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 on noncompact semialgebraic sets via KKT ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial optimization problems via the truncated tangency variety and sums of squares / 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: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint qualifications characterizing Lagrangian duality in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs / 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: Nonsmooth vector functions and continuous 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: Convexity in SemiAlgebraic Geometry and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying convergence of Lasserre's hierarchy via flat truncation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing polynomials via sum of squares over the gradient ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of squares on real algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguished representations of non-negative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-moment problem for compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Polynomials on Compact Semialgebraic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Convex Polynomials / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2013.11.005 / rank
 
Normal rank

Latest revision as of 01:57, 11 December 2024

scientific article
Language Label Description Also known as
English
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
scientific article

    Statements

    Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (English)
    0 references
    27 August 2018
    0 references
    convex polynomial optimization
    0 references
    sums-of-squares of polynomials
    0 references
    semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers