On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
From MaRDI portal
Recommendations
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- scientific article; zbMATH DE number 7549309
- Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- A note on characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
Cites work
- A unifying approach to robust convex infinite optimization duality
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Approximate necessary optimality in fractional semi-infinite multiobjective optimization
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Characterization of norm-based robust solutions in vector optimization
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Complete characterizations of robust strong duality for robust vector optimization problems
- From scalar to vector optimization.
- Higher-order Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 7347486 (Why is no real title available?)
- scientific article; zbMATH DE number 7238249 (Why is no real title available?)
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Multiple-objective programs in Banach spaces: sufficiency for (proper) optimality
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- Nonsmooth optimization using Mordukhovich's subdifferential
- Nonsmooth semi-infinite multiobjective optimization problems
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On optimality conditions for robust weak sharp solution in uncertain optimizations
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- On the notion of proper efficiency in vector optimization
- On the subdifferentiability of the difference of two functions and local minimization
- Optimality and duality for proper and isolated efficiencies in multiobjective optimization
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Optimality conditions for semi-infinite programming problems under relaxed quasiconvexity assumptions
- Optimality conditions in convex multiobjective SIP
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Optimization and nonsmooth analysis
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Robust linear semi-infinite programming duality under uncertainty
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimization
- Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
- Robustness in deterministic vector optimization
- Robustness in nonsmooth nonconvex optimization problems
- Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
- Stability of properly efficient points and isolated minimizers of constrained vector optimization problems
- Stable Farkas lemmas and duality for nonconvex composite semi-infinite programming problems
- Strict efficiency in vector optimization
- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Theory and applications of robust optimization
Cited in
(7)- scientific article; zbMATH DE number 5811784 (Why is no real title available?)
- Approximate proper efficiencies in nonsmooth semi-infinite multiobjective optimization problems
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Approximate optimality conditions for approximate efficiency in semi-infinite multiobjective fractional programming problem
- On isolated and proper efficiencies in fractional multiobjective optimization problems involving equality and inequality constraints
This page was built for publication: On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693835)
