scientific article; zbMATH DE number 6129549
From MaRDI portal
Publication:4901092
zbMATH Open1265.90250MaRDI QIDQ4901092FDOQ4901092
Authors: Jingnan Wang, Jiawei Chen, Jun Li 
Publication date: 24 January 2013
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 6673762
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- scientific article; zbMATH DE number 1159287
- Optimality conditions and duality in nonsmooth multiobjective optimization
- scientific article; zbMATH DE number 853072
- scientific article; zbMATH DE number 5150864
- Optimality conditions and duality in nonsmooth multiobjective programs
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Higher-order optimality conditions in nonsmooth cone-constrained multiobjective programming
- Optimality conditions and duality for a class of nondifferentiable multiobjective programming problems
weakly efficient solutionsaddle pointstrong dualityweak dualitygeneralized cone-invex functionnonsmooth multiobjective optimization problemconverse dualityKuhn-Tucker condition
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cited In (11)
- Multiobjective optimization problems with modified objective functions and cone constraints and applications
- On optimality conditions and duality for multiobjective optimization with equilibrium constraints
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- Optimality for E-\([0,1]\) convex multi-objective programming
- Necessary and sufficient KKT optimality conditions in non-convex multi-objective optimization problems with cone constraints
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
- Title not available (Why is that?)
- Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
- Optimality conditions for a class of composite multiobjective nonsmooth optimization problems
- First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901092)
