Lagrangian duality in convex conic programming with simple proofs (Q6200791): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Linear Inequalities and Related Systems. (AM-38) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5476574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality and minimal representations for cone optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong duality in linear copositive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality in lasserre's hierarchy for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Closedness of the Linear Image of a Closed Convex Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear inequalities, mathematical programming and matrix theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Farkas’ Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear equations over cones with interior: a solvability theorem with applications to matrix theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5421709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank

Revision as of 10:36, 27 August 2024

scientific article; zbMATH DE number 7806977
Language Label Description Also known as
English
Lagrangian duality in convex conic programming with simple proofs
scientific article; zbMATH DE number 7806977

    Statements

    Lagrangian duality in convex conic programming with simple proofs (English)
    0 references
    0 references
    0 references
    20 February 2024
    0 references
    convex conic programming
    0 references
    strong duality
    0 references
    generalized theorems of alternatives
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers