Second-order optimality conditions for \(C^1\) multiobjective programming problems

zbMath1027.90079MaRDI QIDQ696130

Angelo Guerraggio, Dinh The Luc, Nguyen Ba Minh

Publication date: 14 January 2004

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

approximate Hessianapproximate Jacobianconstrained multiobjective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (14)

On optimality conditions for nonsmooth vector problems in normed spaces via generalized Hadamard directional derivatives ⋮ Pseudo-Hessian and Taylor's expansion for vector-valued functions ⋮ First and second order optimality conditions using approximations for nonsmooth vector optimization in Banach spaces ⋮ First- and second-order optimality conditions in optimistic bilevel set-valued programming ⋮ New second-order Karush-Kuhn-Tucker optimality conditions for vector optimization ⋮ Second-order optimality conditions in minimax optimization problems ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Second-order optimality conditions for problems with \(C^{1}\) data ⋮ Second-order conditions for nonsmooth multiobjective optimization problems with inclusion constraints ⋮ Second-order optimality conditions using approximations for nonsmooth vector optimization problems under inclusion constraints ⋮ Second order optimality conditions for bilevel set optimization problems ⋮ Chain rules for approximate Jacobians of continuous functions ⋮ Strong second-order Karush–Kuhn–Tucker optimality conditions for vector optimization ⋮ Optimality conditions for an isolated minimum of order two in \(C1\) constrained optimization

This page was built for publication: Second-order optimality conditions for \(C^1\) multiobjective programming problems