Strict approximate duality in vector spaces (Q1115349): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0096-3003(88)90074-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065494537 / rank | |||
Normal rank | |||
Revision as of 21:59, 19 March 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
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
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
