BRILLI, ANDREA
BRILLI, ANDREA
DIPARTIMENTO DI INGEGNERIA INFORMATICA, AUTOMATICA E GESTIONALE -ANTONIO RUBERTI-
Mostra
prodotti
Risultati 1 - 6 di 6 (tempo di esecuzione: 0.016 secondi).
Airoyoung dissertation award 2025
2025 Brilli, Andrea
An interior point method for nonlinear constrained derivative-free optimization
2025 Brilli, Andrea; Liuzzi, Giampaolo; Lucidi, Stefano
Complexity results and active-set identification of a derivative-free method for bound-constrained problems
2024 Brilli, Andrea; Cristofari, Andrea; Liuzzi, Giampaolo; Lucidi, Stefano
Derivative-free optimization: worst-case complexity for line-search methods and a mixed penalty-barrier approach
2025 Brilli, Andrea
Nonlinear Derivative-free Constrained Optimization with a Mixed Penalty-Logarithmic Barrier Approach and Direct Search
2024 Brilli, Andrea; Custodio, Ana L.; Liuzzi, Giampaolo; Silva, Everton J.
Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms
2024 Brilli, A.; Kimiaei, M.; Liuzzi, Giampaolo; Lucidi, Stefano
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Airoyoung dissertation award 2025 | 2025 | Brilli, Andrea | |
| An interior point method for nonlinear constrained derivative-free optimization | 2025 | Brilli, Andrea; Liuzzi, Giampaolo; Lucidi, Stefano | |
| Complexity results and active-set identification of a derivative-free method for bound-constrained problems | 2024 | Brilli, Andrea; Cristofari, Andrea; Liuzzi, Giampaolo; Lucidi, Stefano | |
| Derivative-free optimization: worst-case complexity for line-search methods and a mixed penalty-barrier approach | 2025 | Brilli, Andrea | |
| Nonlinear Derivative-free Constrained Optimization with a Mixed Penalty-Logarithmic Barrier Approach and Direct Search | 2024 | Brilli, Andrea; Custodio, Ana L.; Liuzzi, Giampaolo; Silva, Everton J. | |
| Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms | 2024 | Brilli, A.; Kimiaei, M.; Liuzzi, Giampaolo; Lucidi, Stefano |