On first order optimality conditions for vector optimization
From MaRDI portal
Publication:1432850
DOI10.1007/s10255-003-0112-4zbMath1044.90050OpenAlexW2046862746MaRDI QIDQ1432850
L. M. Graña Drummond, Benar Fux Svaiter, Alfredo Noel Iusem
Publication date: 22 June 2004
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-003-0112-4
Related Items (2)
New second-order contingent epiderivatives and set-valued optimization problems ⋮ Optimality Conditions in Semidefinite Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality conditions in multiobjective differentiable programming
- Characterizing optimality in mathematical programming models
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- A saddle-point characterization of Pareto optima
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Steepest descent methods for multicriteria optimization.
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Proper efficiency and the theory of vector maximization
- Optimization and nonsmooth analysis
- Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
- On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints
- A First Course in Optimization Theory
- Some new classes of generalized concave vector-valued functions
- Convex Analysis
This page was built for publication: On first order optimality conditions for vector optimization
