Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations
Abstract
We address black-box convex optimization problems, where the objective and constraint functions are not explicitly known but can be sampled within the feasible set. The challenge is thus to generate a sequence of feasible points converging towards an optimal solution. By leveraging the knowledge of the smoothness properties of the objective and constraint functions, we propose a novel zeroth-order method, SZO-QQ, that iteratively computes quadratic approximations of the constraint functions, constructs local feasible sets and optimizes over them. We prove convergence of the sequence of the objective values generated at each iteration to the minimum. Through experiments, we show that our method can achieve faster convergence compared with state-of-the-art zeroth-order approaches to convex optimization.
Cite
@article{arxiv.2211.02645,
title = {Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations},
author = {Baiwei Guo and Yuning Jiang and Maryam Kamgarpour and Giancarlo Ferrari-Trecate},
journal= {arXiv preprint arXiv:2211.02645},
year = {2022}
}