Convex vector functions and their subdifferential
From MaRDI portal
Publication:1267362
zbMath0906.49007MaRDI QIDQ1267362
Publication date: 15 December 1998
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Related Items
The proximal point method with a vectorial Bregman regularization in multiobjective DC programming, The Lipschitzianity of convex vector and set-valued functions, Subgradient algorithms for solving variable inequalities, Some properties of K-convex mappings in variable ordering settings, A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application, Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization, On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions, Characterization of convex and generalized convex vector fields on Riemannian manifolds, Optimality conditions for nonsmooth vector problems in normed spaces, Order-preserving transformations and applications, A steepest descent-like method for variable order vector optimization problems, A subgradient-like algorithm for solving vector convex inequalities, The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, Existences of solutions for generalized vector quasi-equilibrium problems, Optimality conditions for \(C^{1,1}\) vector optimization problems, Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems, Unnamed Item, Generalized vector quasi-equilibrium problems with applications
