Efficient proximal subproblem solvers for a nonsmooth trust-region method
Computational Optimization and Applications · 2025-01 · 90 (1) · 193-226
DOI: 10.1007/s10589-024-00628-x ↗Kurz gefasst
Fachartikel in der Zeitschrift Computational Optimization and Applications, online erschienen am 04.01.2025. Verfasst von Robert J. Baraldi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 55 Literaturangaben. Gefördert von: Advanced Scientific Computing Research.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Advanced Scientific Computing Research
Zitieren
APA
Baraldi, R. J., & Kouri, D. P. (2025). Efficient proximal subproblem solvers for a nonsmooth trust-region method. Computational Optimization and Applications, 90(1), 193-226. https://doi.org/10.1007/s10589-024-00628-x
Vancouver
Baraldi RJ, Kouri DP. Efficient proximal subproblem solvers for a nonsmooth trust-region method. Computational Optimization and Applications. 2025;90(1):193-226. doi:10.1007/s10589-024-00628-x
BibTeX
@article{Baraldi2025,
author = {Baraldi, Robert J. and Kouri, Drew P.},
title = {Efficient proximal subproblem solvers for a nonsmooth trust-region method},
journal = {Computational Optimization and Applications},
year = {2025},
volume = {90},
number = {1},
pages = {193--226},
doi = {10.1007/s10589-024-00628-x}
}
EUVIMED