A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex Optimization.

François Bachoc Tommaso Cesari Roberto Colomboni Andrea Paudice

Published in: CoRR (2022)

Keyphrases

convex optimization
learning algorithm
computational complexity
np hard
dynamic programming
objective function
cost function
high quality
optimal solution
object recognition
low rank
high dimensional data
globally optimal
convex relaxation
augmented lagrangian