Safe zeroth-order optimization using quadratic local approximations
From MaRDI portal
Cites work
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- An inexact restoration derivative-free filter method for nonlinear programming
- Approximate KKT points and a proximity measure for termination
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Black-Box Optimization: Methods and Applications
- Constrained, global optimization of unknown functions with Lipschitz continuous gradients
- Distributed robust adaptive equilibrium computation for generalized convex games
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Non-convex optimization for machine learning
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Pattern Search Methods for Linearly Constrained Minimization
- Relative Perturbation Theory: I. Eigenvalue and Singular Value Variations
- SMGO-\(\Delta\): balancing caution and reward in global optimization with black-box constraints
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Tensor methods for finding approximate stationary points of convex functions
- Trust Region Methods
This page was built for publication: Safe zeroth-order optimization using quadratic local approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6929984)
