An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
|
10.1016/j.ejor.2024.07.019
|
1403 - 04
|
|
A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
|
10.1080/02331934.2024.2322152
|
1402 - 12
|
|
A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
|
https://doi.org/10.1007/s10957-020-01740-8
|
2020 - 08
|
|
A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
|
https://doi.org/10.1007/s10589-020-00213-y
|
2020 - 07
|
|
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
|
https://doi.org/10.1080/10556788.2021.2023522
|
2022 - 02
|
|
An effective subgradient algorithm via Mifflin’s line search for nonsmooth nonconvex multiobjective optimization
|
https://doi.org/10.1016/j.ejor.2024.07.019
|
2024 - 07
|
|