Applying convexificators in robust multiobjective optimization
From MaRDI portal
Recommendations
- Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
- Sufficient Optimality Conditions for a Robust Multiobjective Problem
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- On robust convex multiobjective optimization
Cites work
- A characterization of quasiconvex vector-valued functions
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Characterizing robust solution sets of convex programs under data uncertainty
- Connectedness of the efficient point sets in quasiconcave vector maximization
- Convexifactors, generalized convexity and vector optimization
- Convexifactors, generalized convexity, and optimality conditions
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- Improved enhanced Fritz John condition and constraints qualifications using convexificators
- Linear programming with uncertain data: some extensions to robust optimization
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Necessary optimality conditions for bilevel set optimization problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Nonsmooth vector functions and continuous optimization
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- On nonsmooth optimality theorems for robust optimization problems
- On robust multiobjective optimization
- On the continuity of the minimum set of a continuous function
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimization and nonsmooth analysis
- Robust duality for generalized convex programming problems under data uncertainty
- Robust optimization
- Scalarization and lagrange duality in multiobjective optimization
- Set-valued optimization. An introduction with applications
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Subsmooth semi-infinite and infinite optimization problems
- Tractable approximations to robust conic optimization problems
- What is quasiconvex analysis?
Cited in
(2)
This page was built for publication: Applying convexificators in robust multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086987)
