On scalar and vector \(\ell \)-stable functions
From MaRDI portal
Publication:603029
DOI10.1016/j.na.2010.08.032zbMath1205.26007MaRDI QIDQ603029
Publication date: 5 November 2010
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2010.08.032
vector optimization; optimality conditions; Lipschitz functions; \(\ell \)-stable functions; \(C^{1,1}\) functions
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
49J52: Nonsmooth analysis
26A16: Lipschitz (Hölder) classes
Related Items
Unnamed Item, Second-order optimality conditions with the envelope-like effect in nonsmooth multiobjective mathematical programming. I: \(l\)-stability and set-valued directional derivatives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data
- Differentiability properties of functions that are \(\ell \)-stable at a point
- From scalar to vector optimization.
- \(\ell \)-stable functions are continuous
- Fréchet approach in second-order optimization
- The second order optimality conditions for nonlinear mathematical programming with \(C^{1,1}\) data
- Optimality conditions for \(C^{1,1}\) constrained multiobjective problems
- Second-order subdifferentials of \(C^{1,1}\) functions and optimality conditions
- On second-order conditions in unconstrained optimization
- Second-order conditions in \(C^{1,1}\) constrained vector optimization
- A Generalized Second-Order Derivative in Nonsmooth Optimization
- On second-order sufficient optimality conditions for c 1,1-optimization problems
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- Second-order conditions in c1, 1optimization with applications
- Generalized second-order directional derivatives and optimization with C1,1 functions
- Approximation of set-valued functions by single-valued one
- Elimination of Strict Convergence in Optimization
- Set-valued analysis
- Optimality conditions for \(C^{1,1}\) vector optimization problems
