Author

Gianluca Bianchin

h-index 1 View on Semantic Scholar

We have 1 of 10 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback

A randomized two-point direct-search algorithm for nonconvex time-varying optimization and derive iteration-complexity bounds under both constant and diminishing probing ratios, which recover the complexity of existing zeroth-order methods in the time-invariant setting while extending direct- search methods beyond static settings.

Gaspar Robert, Gianluca Bianchin · 0 citations