Pages that link to "Item:Q816065"

The following pages link to Optimality conditions for D.C. vector optimization problems under reverse convex constraints (Q816065):

Displaying 9 items.

• Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions (Q289089) (← links)
• Optimality conditions for vector optimization problems with difference of convex maps (Q463000) (← links)
• Characterizing strict efficiency for convex multiobjective programming problems (Q625650) (← links)
• Optimality conditions for minimizing the difference of nonconvex vector-valued mappings (Q742398) (← links)
• Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
• Subdifferential and optimality conditions for the difference of set-valued mappings (Q1928537) (← links)
• Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization (Q2342964) (← links)
• Calculus of tangent sets and derivatives of set-valued maps under metric subregularity conditions (Q2392751) (← links)
• Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality (Q6189128) (← links)