A new approximation hierarchy for polynomial conic optimization (Q2419540): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPARA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sparse-BSOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPOTless / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2911427463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of polynomial optimization in operations research and real-time decision making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones, matrices and mathematical programming / 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: Q5490302 / 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: On an extension of Pólya's Positivstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive polynomials in control. / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / 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: A Sum-of-Squares Approach to Fixed-Order H∞-Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables / 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: Pure states, positive matrix polynomials and sums of hermitian squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES / 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: Q3395491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded degree SOS hierarchy for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representations for finite varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem / 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: Certifying convergence of Lasserre's hierarchy via flat truncation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact Jacobian SDP relaxation for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Optimization with Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and finite convergence of Lasserre's hierarchy / 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: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Copositive Programming Approach to Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive polynomials on semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / 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: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / 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: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank

Latest revision as of 12:27, 19 July 2024

scientific article
Language Label Description Also known as
English
A new approximation hierarchy for polynomial conic optimization
scientific article

    Statements

    A new approximation hierarchy for polynomial conic optimization (English)
    0 references
    0 references
    0 references
    13 June 2019
    0 references
    polynomial conic optimization
    0 references
    polynomial semi-definite programming
    0 references
    polynomial second-order cone programming
    0 references
    approximation hierarchy
    0 references
    linear programming
    0 references
    semi-definite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references