Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2017.07.076 / rank
Normal rank
 
Property / author
 
Property / author: Thai Doan Chuong / rank
Normal rank
 
Property / author
 
Property / author: Vaithilingam Jeyakumar / rank
Normal rank
 
Property / author
 
Property / author: Thai Doan Chuong / rank
 
Normal rank
Property / author
 
Property / author: Vaithilingam Jeyakumar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVX / 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.amc.2017.07.076 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2755386969 / 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: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4557933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent conic linear programming relaxations for cone convex polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals / 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: Q5494164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4357206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post-Optimal Analysis in Linear Semi-Infinite Optimization / 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: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for semi-infinite polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2871233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2978415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / 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: On general minimax theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for semi-infinite polynomial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving a class of linear semi-infinite programming by SDP method / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2017.07.076 / rank
 
Normal rank

Latest revision as of 07:15, 11 December 2024

scientific article
Language Label Description Also known as
English
Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
scientific article

    Statements

    Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (English)
    0 references
    29 April 2019
    0 references
    semi-infinite optimization
    0 references
    polynomial program
    0 references
    semidefinite linear program
    0 references
    relaxation problem
    0 references
    approximation
    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