Pages that link to "Item:Q1267362"

The following pages link to Convex vector functions and their subdifferential (Q1267362):

Displaying 26 items.

• The Lipschitzianity of convex vector and set-valued functions (Q286214) (← links)
• Subgradient algorithms for solving variable inequalities (Q297868) (← links)
• A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application (Q319989) (← links)
• On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions (Q402526) (← links)
• A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
• A subgradient-like algorithm for solving vector convex inequalities (Q467438) (← links)
• Existences of solutions for generalized vector quasi-equilibrium problems (Q941024) (← links)
• Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems (Q1044514) (← links)
• Subdifferential characterization of quasiconvex and convex vector functions (Q1277219) (← links)
• Order-preserving transformations and applications (Q1422857) (← links)
• Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
• Generalized vector quasi-equilibrium problems with applications (Q1869008) (← links)
• Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization (Q2150766) (← links)
• A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
• Characterization of convex and generalized convex vector fields on Riemannian manifolds (Q2682704) (← links)
• An approach to vector subdifferentials (Q2785402) (← links)
• (Q3446254) (← links)
• Subdifferentials and vector optimization. (Q3981845) (← links)
• Vector subdifferentials via recession mappings^∗^∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef: (Q4351789) (← links)
• The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem (Q4637508) (← links)
• (Q4908007) (← links)
• The proximal point method with a vectorial Bregman regularization in multiobjective DC programming (Q5034939) (← links)
• Some properties of <i>K</i>-convex mappings in variable ordering settings (Q5057971) (← links)
• Optimality conditions for nonsmooth vector problems in normed spaces (Q5110319) (← links)
• (Q5158549) (← links)
• Optimality conditions for \(C^{1,1}\) vector optimization problems (Q5945072) (← links)