Complexity of trust-region methods in the presence of unbounded Hessian approximations
Year of publication: |
[2024]
|
---|---|
Authors: | Diouane, Youssef ; Laghdaf Habiboullah, Mohamed ; Orban, Dominique |
Publisher: |
Montréal (Québec), Canada : GERAD, HÉC Montréal |
Subject: | Complexity analysis | quasi-Newton methods | trust-region | unconstrained optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Komplexitätsmanagement | Complexity management | Komplexe Systeme | Complex systems |
-
Algorithms and time complexity of the request-service problem
Liu, Chunmei, (2010)
-
On the information-based complexity of stochastic programming
Tavares, Gabriela, (2013)
-
On the complexity of the FIFO stack-up problem
Gurski, Frank, (2016)
- More ...
-
A proximal modified quasi-Newton method for nonsmooth regularized optimization
Diouane, Youssef, (2024)
-
Diouane, Youssef, (2024)
-
Diouane, Youssef, (2024)
- More ...