Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Mar 29, 2023 · We propose a novel zeroth-order method that iteratively computes quadratic approximations of the constraint functions, constructs local feasible sets and ...
Nov 4, 2022 · We propose a novel zeroth-order method, SZO-QQ, that iteratively computes quadratic approximations of the constraint functions, constructs local feasible sets ...
To this purpose we use local quadratic approximations of the constraints based on the knowledge of the Lipschitz constants of the con- straints' gradients ...
Abstract. We address black-box convex optimization problems, where the objective and constraint functions are not explicitly known but can be sampled within ...
Apr 5, 2023 · This paper addresses black-box smooth optimization problems, where the objective and constraint functions are not explicitly known but can ...
Aug 2, 2023 · Assuming to have prior knowledge on the smoothness of the unknown objective and constraints, we propose a novel zeroth-order method ... [Show ...
Abstract. Single-point zeroth-order optimization (SZO) is useful in solving online black-box optimization and control problems in time-varying environ-.
People also ask
Safe zeroth-order optimization using quadratic local approximations. B Guo, Y Jiang, G Ferrari-Trecate, M Kamgarpour. arXiv preprint arXiv:2303.16659, 2023. 2 ...
The present work proposes a real-time optimization modifier adaptation scheme (RTO MA) in which the modifiers are obtained through a quadratic approximation ...
We propose Log Barriers SGD (LB-SGD), an algorithm that addresses the safe learning task by minimizing the log barrier approximation of the problem. This ...