A strong duality theorem for the minimum of a family of convex programs (Q1131953): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jonathan M. Borwein / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q56936041 / rank
 
Normal rank
Property / author
 
Property / author: Jonathan M. Borwein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on duality in disjunctive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit duality for convex homogeneous programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for a penalty method to be exact / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for duality in homogeneous programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-planes for programs with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-Planes for Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability theorems for infinitely constrained mathematical programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:29, 13 June 2024

scientific article
Language Label Description Also known as
English
A strong duality theorem for the minimum of a family of convex programs
scientific article

    Statements

    A strong duality theorem for the minimum of a family of convex programs (English)
    0 references
    1980
    0 references
    strong duality theorem
    0 references
    single concave dual maximization
    0 references
    linear disjunctive programming
    0 references
    homogeneous and symmetric formulations
    0 references
    families of programs
    0 references

    Identifiers