Convex vector functions and their subdifferential
From MaRDI portal
Recommendations
Cited in
(26)- Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
- Subdifferential characterization of quasiconvex and convex vector functions
- 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
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Characterization of convex and generalized convex vector fields on Riemannian manifolds
- An approach to vector subdifferentials
- 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
- scientific article; zbMATH DE number 5164422 (Why is no real title available?)
- scientific article; zbMATH DE number 3930750 (Why is no real title available?)
- On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions
- Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef:
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- A steepest descent-like method for variable order vector optimization problems
- A subgradient-like algorithm for solving vector convex inequalities
- scientific article; zbMATH DE number 6139439 (Why is no real title available?)
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- Some properties of K-convex mappings in variable ordering settings
- Optimality conditions for nonsmooth vector problems in normed spaces
- Multiobjective approaches based on variable ordering structures for intensity problems in radiotherapy treatment
- Optimality conditions for \(C^{1,1}\) vector optimization problems
- Existences of solutions for generalized vector quasi-equilibrium problems
This page was built for publication: Convex vector functions and their subdifferential
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267362)
