Pages that link to "Item:Q2031935"
From MaRDI portal
The following pages link to An efficient descent method for locally Lipschitz multiobjective optimization problems (Q2031935):
Displaying 7 items.
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- Approximations for Pareto and proper Pareto solutions and their KKT conditions (Q2168054) (← links)
- An incremental descent method for multi-objective optimization (Q5882236) (← links)
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets (Q6085818) (← links)
- Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)
- A line search technique for a class of multi-objective optimization problems using subgradient (Q6564720) (← links)
- A descent method for nonsmooth multiobjective optimization in Hilbert spaces (Q6636793) (← links)
