Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data
From MaRDI portal
Publication:700934
DOI10.1023/A:1022272728208zbMath0995.90085MaRDI QIDQ700934
Liping Liu, Michal Křížek, Pekka Neittaanmäki
Publication date: 15 October 2002
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/33066
multiobjective programmingsecond-order optimality conditionsnonsmooth constrained optimizationnondominated solutionslocal Pareto optimal solutions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items (15)
On second-order Fritz John type optimality conditions in nonsmooth multiobjective programming ⋮ On scalar and vector \(\ell \)-stable functions ⋮ Locally Lipschitz vector optimization with inequality and equality constraints. ⋮ First order optimality conditions in vector optimization involving stable functions ⋮ On relations of vector optimization results with \(C^{1,1}\) data ⋮ First and second-order optimality conditions for nonsmooth vector optimization using set-valued directional derivatives ⋮ Second-order optimality conditions with the envelope-like effect in nonsmooth multiobjective mathematical programming. I: \(l\)-stability and set-valued directional derivatives ⋮ Second-order optimality conditions with the envelope-like effect in nonsmooth multiobjective mathematical programming. II: Optimality conditions ⋮ Second-order conditions for constrained vector optimization problems with ℓ-stable data ⋮ Second-order sequence-based necessary optimality conditions in constrained nonsmooth vector optimization and applications ⋮ From scalar to vector optimization. ⋮ On necessary optimality conditions for nonsmooth vector optimization problems with mixed constraints in infinite dimensions ⋮ Parameter-free duality models and applications to semi-infinite minmax fractional programming based on second-order (\(\phi,\eta ,\rho ,\theta,\tilde{m}\))-sonvexities ⋮ Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems ⋮ Second-order conditions in \(C^{1,1}\) constrained vector optimization
Cites Work
- Second-order and related extremality conditions in nonlinear programming
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Foundations of optimization
- The second order optimality conditions for nonlinear mathematical programming with \(C^{1,1}\) data
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- First and second-order optimality conditions for convex composite multiobjective optimization
- A comparison of second-order epiderivatives: Calculus and optimality conditions
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- On second-order sufficient optimality conditions for c 1,1-optimization problems
- Second-order necessary and sufficient conditions in multiobjective programming∗
- Generalized second-order derivatives and optimality conditions
- Generalized second-order directional derivatives and optimization with C1,1 functions
- Taylor’s Formula for $C^{k,1} $ Functions
- Second Order Conditions for Constrained Minima
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data
