A Note on Using Performance and Data Profiles for Training Algorithms

DOI10.1145/3310362zbMath1471.68328arXiv1711.09407OpenAlexW2963981018WikidataQ113310019 ScholiaQ113310019MaRDI QIDQ5237433

Margherita Porcelli, Phillipe L. Toint

Publication date: 18 October 2019

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.09407

zbMATH Keywords

derivative-free optimizationhyper-parameters optimizationalgorithmic designtrainable codes

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mixed integer programming (90C11) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (4)

Efficient unconstrained black box optimization ⋮ Exploiting Problem Structure in Derivative Free Optimization ⋮ A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization ⋮ Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound

This page was built for publication: A Note on Using Performance and Data Profiles for Training Algorithms