Strict approximate duality in vector spaces (Q1115349): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4746375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrange multiplier theorem and a sandwich theorem for convex relations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Vector Minimization and Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4104377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5511567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-solutions in vector minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified approach to approximate solutions in games and multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ε-Optimal solutions in nondifferentiable convex programming and some related questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3913878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate saddle-point theorems in vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: The saddle point theorem of Kuhn and Tucker in ordered vector spaces / rank
 
Normal rank

Latest revision as of 13:55, 19 June 2024

scientific article
Language Label Description Also known as
English
Strict approximate duality in vector spaces
scientific article

    Statements

    Strict approximate duality in vector spaces (English)
    0 references
    0 references
    1988
    0 references
    The author considers optimization problems with targets in an order complete vector lattice and discusses interrelations between saddle-point theorems, \(\epsilon\)-subdifferentials and the like. Implicit ties between scalar and vector optimization can also be illuminated via Boolean-valued analysis [see, for example, \textit{A. G. Kusraev} and \textit{S. S. Kutateladze}, ``Subdifferential calculus'', Novosibirsk, Nauka (1987)].
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    strict approximate duality
    0 references
    \(\epsilon \) -solutions
    0 references
    order complete vector lattice
    0 references
    saddle-point theorems
    0 references
    \(\epsilon \) -subdifferentials
    0 references
    vector optimization
    0 references
    0 references