Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-013-0496-0 / rank
Normal rank
 
Property / author
 
Property / author: José Vicente-Pérez / rank
Normal rank
 
Property / author
 
Property / author: Vaithilingam Jeyakumar / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Xiangsun Zhang / rank
Normal rank
 
Property / author
 
Property / author: José Vicente-Pérez / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Xiangsun Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993400404 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.5151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max optimization of several classical discrete optimization problems / 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: Strong Duality in Robust Convex Programming: Complete Characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779970 / 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: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / 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: Q3601990 / 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: Q3149262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farkas-type results for max-functions and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for generalized fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality without a constraint qualification for minimax fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-013-0496-0 / rank
 
Normal rank

Latest revision as of 18:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Dual semidefinite programs without duality gaps for a class of convex minimax programs
scientific article

    Statements

    Dual semidefinite programs without duality gaps for a class of convex minimax programs (English)
    0 references
    23 October 2014
    0 references
    The authors introduce a new dual program, which is representable as a semidefinite linear programming problem, for a primal convex minimax programming problem. They show that there is no duality gap between the primal and the dual whenever the functions involved are sum-of-squares convex polynomials. The strong duality results for this class of minimax problems are derived under a suitable constraint qualification.
    0 references
    sum-of-squares convex polynomials
    0 references
    minimax programming
    0 references
    semidefinite programming
    0 references
    duality
    0 references
    zero duality gap
    0 references

    Identifiers

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