5 problems

Midpoint constraint-violation conjecture. The constraint violation bound under the midpoint method scales as

In smooth nonconvex zeroth-order optimization, consider the dimension dependence of the sample complexity for finding first-order stationary points. Optimal dimension dependence co…

Consider the affine-constrained case in which ${\mathbf{c}}({\mathbf{x}})={\mathbf{A}}{\mathbf{x}}-{\mathbf{b}}$, and let $h$ denote the nonsmooth term in the composite objective.…

Optimality conjecture. Under these assumptions, the obtained bound for zeroth-order oracle calculations per node is optimal up to polylogarithmic factors among methods with an opti…

Consider zeroth-order convex optimization in the robust setting, where an adversary may arbitrarily corrupt an … denote the target accuracy. Optimal robust query-complexity conject…