Approximate solution in robust multi-objective optimization and its application in portfolio optimization
From MaRDI portal
Recommendations
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
Cites work
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- A globally convergent method for solving a quartic generalized Markowitz portfolio problem
- Efficient cardinality/mean-variance portfolios
- Generalizations of Slater's constraint qualification for infinite convex programs
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- Linear semi-infinite optimization: recent advances
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- On nonsmooth optimality theorems for robust optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On semi-infinite minmax programming with generalized invexity
- Optimality and duality for robust multiobjective optimization problems
- Robust convex optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust optimization
- Uniform duality in semi-infinite convex optimization
This page was built for publication: Approximate solution in robust multi-objective optimization and its application in portfolio optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065194)