Convex vector functions and their subdifferential

zbMath0906.49007MaRDI QIDQ1267362

K. Appert

Publication date: 15 December 1998

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

monotonicity; vector optimization problems; subdifferential; generalized Jacobian; convex vector function

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

49J52: Nonsmooth analysis

Related Items

The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, Optimality conditions for \(C^{1,1}\) vector optimization problems, The Lipschitzianity of convex vector and set-valued functions, Subgradient algorithms for solving variable inequalities, A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application, On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions, A steepest descent-like method for variable order vector optimization problems, A subgradient-like algorithm for solving vector convex inequalities, Existences of solutions for generalized vector quasi-equilibrium problems, Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems, Order-preserving transformations and applications, Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels, Generalized vector quasi-equilibrium problems with applications, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems