On strong duality in linear copositive programming (Q2149604): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3130358933 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2004.09865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive programming via semi-infinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On copositive programming and standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive optimization -- recent developments and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance and efficiency of convex representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Considering copositivity locally / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the irreducibility, self-duality an non-homogeneity of completely positive cones / 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: Perfect duality in semi-infinite and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immobile indices and CQ-free optimality criteria for linear copositive programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality criteria without constraint qualifications for linear semidefinite problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for linear copositive programming problems with isolated immobile indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for semi-definite and semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Time Series Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality and minimal representations for cone optimization / rank
 
Normal rank

Latest revision as of 11:40, 29 July 2024

scientific article
Language Label Description Also known as
English
On strong duality in linear copositive programming
scientific article

    Statements

    On strong duality in linear copositive programming (English)
    0 references
    0 references
    0 references
    29 June 2022
    0 references
    linear copositive programming
    0 references
    strong duality
    0 references
    normalized immobile index set
    0 references
    extended dual problem
    0 references
    constraint qualification
    0 references
    semi-infinite programming (SIP)
    0 references
    semidefinite programming (SDP)
    0 references
    0 references
    0 references

    Identifiers

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