Memory gradient method for robust multiobjective optimization problems
From MaRDI portal
Cites work
- A derivative-free rooted tree method in nonconvex set optimization
- A Newton method for uncertain multiobjective optimization problems with finite uncertainty sets
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- An accelerated subgradient extragradient algorithm for solving bilevel variational inequality problems involving non-Lipschitz operator
- Approximate subgradient extragradient methods for solving variational inequality problems: convergence analysis and applications in signal and image processing
- Dominance for multi-objective robust optimization concepts
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Inertial subgradient extragradient method for solving pseudomonotone variational inequality problems in Banach spaces
- Memory gradient method for multiobjective optimization
- Minmax robustness for multi-objective optimization problems
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On cone convexity of set-valued maps
- On robust multiobjective optimization
- Pareto solutions in multicriteria optimization under uncertainty
- Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust multiobjective portfolio optimization: a set order relations approach
- Robust multiple objective game theory
- Robust optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Steepest descent method for uncertain multiobjective optimization problems under finite uncertainty set
- Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations
This page was built for publication: Memory gradient method for robust multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391568)