Second-order optimality conditions for efficiency in C^1-smooth robustly quasiconvex multiobjective programming problems
From MaRDI portal
Publication:6620697
Cites work
- scientific article; zbMATH DE number 1328986 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Characterisations of quasiconvex functions
- Convex Analysis
- Duality in Vector Optimization
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- First order optimality conditions in vector optimization involving stable functions
- Generalized convexity and optimization. Theory and applications
- Necessary conditions for super minimizers in constrained multiobjective optimization
- Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization
- Necessary conditions in multiobjective optimization with equilibrium constraints
- New second-order optimality conditions for vector equilibrium problems with constraints in terms of contingent derivatives
- On second order conditions for quasiconvexity
- On second-order Fritz John type optimality conditions in nonsmooth multiobjective programming
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions based on the Fréchet second-order subdifferential
- Optimality conditions for nonsmooth vector problems in normed spaces
- Pseudo-Convex Functions
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Second-order characterizations of \(\mathcal{C}^1\)-smooth robustly quasiconvex functions
- Second-order characterizations of quasiconvexity and pseudoconvexity for differentiable functions with Lipschitzian derivatives
- Second-order necessary efficiency conditions for nonsmooth vector equilibrium problems
- Set-valued analysis
- Set-valued optimization. An introduction with applications
- Taylor’s Formula for $C^{k,1} $ Functions
- The second-order conditions of nondominated solutions for \(C^{1,1}\) generalized multiobjective mathematical programming
- Unilateral Variational Analysis in Banach Spaces
- Variational analysis and applications
- r-convex functions
This page was built for publication: Second-order optimality conditions for efficiency in \(C^1\)-smooth robustly quasiconvex multiobjective programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620697)
