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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49N15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C46 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C48 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52A20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6251985 / rank
 
Normal rank
Property / zbMATH Keywords
 
zero duality gap
Property / zbMATH Keywords: zero duality gap / rank
 
Normal rank
Property / zbMATH Keywords
 
conic convex program
Property / zbMATH Keywords: conic convex program / rank
 
Normal rank
Property / zbMATH Keywords
 
Courant-Beltrami penalty function
Property / zbMATH Keywords: Courant-Beltrami penalty function / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11117-012-0214-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963616707 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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