Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs (Q395589): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Duality gap of the conic convex constrained optimization problems in normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality gap in convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex functions with continuous epigraph or continuous level sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programs having some linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slice-continuous sets in reflexive Banach spaces: convex constrained optimization and strict convex separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slice-continuous sets in reflexive Banach spaces: some complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Convex Sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalar convergence of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank

Latest revision as of 06:51, 7 July 2024

scientific article
Language Label Description Also known as
English
Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs
scientific article

    Statements

    Identifiers

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