Strict approximate duality in vector spaces

From MaRDI portal





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)].











This page was built for publication: Strict approximate duality in vector spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115349)