A duality theorem for a convex programming problem in order complete vector lattices (Q1220873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Conjugate Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5821624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5806966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of Fenchel's duality theorem for convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5516366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdifferentiability of Convex Functions with Values in an Ordered Vector Space. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The saddle point theorem of Kuhn and Tucker in ordered vector spaces / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:30, 12 June 2024

scientific article
Language Label Description Also known as
English
A duality theorem for a convex programming problem in order complete vector lattices
scientific article

    Statements

    Identifiers