Pshenichnyi's theorem for vector minimization
From MaRDI portal
(Redirected from Publication:1078083)
Analogues of Pshenichnyi's necessary and sufficient condition for minima in convex programming problems are given for the case when the objective function is vector-valued.
Cites work
- A general Farkas lemma
- Generalizations of Farkas’ Theorem
- scientific article; zbMATH DE number 3848989 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3762731 (Why is no real title available?)
- scientific article; zbMATH DE number 3590940 (Why is no real title available?)
- scientific article; zbMATH DE number 3441084 (Why is no real title available?)
- scientific article; zbMATH DE number 3271001 (Why is no real title available?)
Cited in
(8)- First and second-order optimality conditions for convex composite multiobjective optimization
- Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Geometrical characterization of weakly efficient points
- Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Optimality conditions for vector optimization problems of a difference of convex mappings
This page was built for publication: Pshenichnyi's theorem for vector minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078083)