scientific article; zbMATH DE number 7546024
From MaRDI portal
Publication:5083070
DOI10.7858/eamj.2021.033zbMath1489.90117MaRDI QIDQ5083070
Publication date: 21 June 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
efficient solutionweakly efficient solutionproperly efficient solutionsemidefinite linear vector optimization problem
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Proper efficiency and the theory of vector maximization
- Introduction to the Theory of Nonlinear Optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Semidefinite Programming
- ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
This page was built for publication: