Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Semidefinite Optimization and Convex Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The truncated tracial moment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Polynomials in Non-Commuting Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Polynomial Optimization Problems with Noncommuting Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the truncated complex moment problem for flat data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost commuting Hermitian matrices. / 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: Q3601985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making almost commuting matrices commute / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex Positivstellensatz in a free algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A positivstellensatz for non-commutative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Noncommutative Polynomials Have Degree Two or Less / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive polynomials in control. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Global Optimality and Extracting Solutions in GloptiPoly / 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: Constrained trace-optimization of polynomials in freely noncommuting variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connes' embedding conjecture and sums of Hermitian squares / 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: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost commuting self-adjoint matrices: The real and self-dual cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncommutative sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\mathcal A\)-truncated \(K\)-moment problem / 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: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost commuting matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / 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: How bad are Hankel matrices? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank

Revision as of 13:43, 17 July 2024

scientific article; zbMATH DE number 6989164
Language Label Description Also known as
English
Minimizer Extraction in Polynomial Optimization Is Robust
scientific article; zbMATH DE number 6989164

    Statements

    Minimizer Extraction in Polynomial Optimization Is Robust (English)
    0 references
    0 references
    0 references
    0 references
    5 December 2018
    0 references
    polynomial optimization
    0 references
    sum of squares
    0 references
    semidefinite programming
    0 references
    moment problem
    0 references
    Hankel matrix
    0 references
    flat extension
    0 references
    GNS construction
    0 references
    noncommutative polynomial
    0 references
    trace
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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