Strict approximate duality in vector spaces

DOI10.1016/0096-3003(88)90074-4zbMath0663.90069OpenAlexW2065494537MaRDI QIDQ1115349

István Vályi

Publication date: 1988

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(88)90074-4

zbMATH Keywords

vector optimizationorder complete vector lattice\(\epsilon \) -solutions\(\epsilon \) -subdifferentialssaddle-point theoremsstrict approximate duality

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\epsilon\)-solutions in vector minimization problems
• Epsilon efficiency
• Unified approach to approximate solutions in games and multiobjective programming
• The saddle point theorem of Kuhn and Tucker in ordered vector spaces
• Approximate saddle-point theorems in vector optimization
• Strong Vector Minimization and Duality
• A Lagrange multiplier theorem and a sandwich theorem for convex relations.
• ε-Optimal solutions in nondifferentiable convex programming and some related questions

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