Random gradient-free minimization of convex functions
From MaRDI portal
(Redirected from Publication:2397749)
Recommendations
- Random algorithms for convex minimization problems
- Random minibatch subgradient algorithms for convex problems with functional constraints
- Random convex programs
- Optimization of convex functions with random pursuit
- Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization
- An optimal randomized incremental gradient method
- A simple randomised algorithm for convex optimisation
- Convergence of a random algorithm for function optimization
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- A variational approach to stochastic minimization of convex functionals
Cites work
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 5485582 (Why is no real title available?)
- A Simplex Method for Function Minimization
- Algorithms for approximate calculation of the minimum of a convex function from its values
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Expected number of steps of a random optimization method
- Introduction to Derivative-Free Optimization
- Introductory lectures on convex optimization. A basic course.
- Lexicographic differentiation of nonsmooth functions
- On the convergence of the Baba and Dorea random optimization methods
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Optimization and nonsmooth analysis
- Random optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Solving convex programs by random walks
- Stochastic convex optimization with bandit feedback
Cited in
(only showing first 100 items - show all)- A unified analysis of stochastic gradient‐free Frank–Wolfe methods
- Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases
- Laplace meets Moreau: smooth approximation to infimal convolutions using Laplace's method
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
- Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization
- Effective stabilized self-training on few-labeled graph data
- Constrained Optimization in the Presence of Noise
- Leveraging randomized smoothing for optimal control of nonsmooth dynamical systems
- On quasi-convex smooth optimization problems by a comparison oracle
- Asynchronous gossip-based gradient-free method for multiagent optimization
- Variable metric random pursuit
- Noisy zeroth-order optimization for non-smooth saddle point problems
- First and zeroth-order implementations of the regularized Newton method with lazy approximated Hessians
- Spanning attack: reinforce black-box attacks with unlabeled data
- Accelerated directional search with non-Euclidean prox-structure
- Minimization Algorithms for Functions with Random Noise
- A trust region method for noisy unconstrained optimization
- Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing
- Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing
- A trust-region approach for computing Pareto fronts in multiobjective derivative-free optimization
- scientific article; zbMATH DE number 5883928 (Why is no real title available?)
- Pathological subgradient dynamics
- A Review of Adversarial Attack and Defense for Classification Methods
- Linearly convergent adjoint free solution of least squares problems by random descent
- Gradient-free two-point methods for solving stochastic nonsmooth convex optimization problems with small non-random noises
- Linesearch Newton-CG methods for convex optimization with noise
- Efficient convex optimization with oracles
- One-point gradient-free methods for smooth and non-smooth saddle-point problems
- High probability complexity bounds for adaptive step search based on stochastic oracles
- Deep learning with Gaussian continuation
- A mixed finite differences scheme for gradient approximation
- Countering the communication bottleneck in federated learning: a highly efficient zero-order optimization technique
- No-regret learning for repeated non-cooperative games with lossy bandits
- Asymptotic analysis of the Ruppert-Polyak averaging for stochastic order oracle
- Accelerated zero-order SGD under high-order smoothness and overparameterized regime
- Global optimization using random embeddings
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- First-order methods for convex optimization
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Small errors in random zeroth-order optimization are imaginary
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- Zeroth-order methods for noisy Hölder-gradient functions
- Dropout ensemble Kalman inversion for high dimensional inverse problems
- Portfolio reshaping under 1st-order stochastic dominance constraints by the exact penalty function methods
- Fully zeroth-order bilevel programming via Gaussian smoothing
- Random descent steps in a probability maximization scheme
- Nonsmooth optimization by Lie bracket approximations into random directions
- Convergence guarantees for forward gradient descent in the linear regression model
- Improved exploitation of higher order smoothness in derivative-free optimization
- Curvature-aware derivative-free optimization
- Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
- Worst case complexity of direct search under convexity
- Smoothed functional-based gradient algorithms for off-policy reinforcement learning: a non-asymptotic viewpoint
- A derivative-free nonlinear least squares solver for nonsmooth functions
- Application of optimization methods in solving the problem of optimal control of assets and liabilities by a bank
- Approximating convex functions via non-convex oracles under the relative noise model
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Zero order algorithm for decentralized optimization problems
- Zeroth-order stochastic compositional algorithms for risk-aware learning
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- Stochastic model-based minimization of weakly convex functions
- Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference
- Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs
- Distributed subgradient-free stochastic optimization algorithm for nonsmooth convex functions over time-varying networks
- Adaptive regularized quasi-Newton method using inexact first-order information
- Zeroth-order random subspace algorithm for non-smooth convex optimization
- Almost sure convergence of randomised-difference descent algorithm for stochastic convex optimisation
- Inverse reinforcement learning in contextual MDPs
- Full-low evaluation methods for derivative-free optimization
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Zeroth-order optimization with orthogonal random directions
- Inexact Laplace approximation and the use of posterior mean in Bayesian inference
- Stochastic three points method for unconstrained smooth minimization
- First- and second-order high probability complexity bounds for trust-region methods with noisy oracles
- On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing
- A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
- Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities
- An accelerated directional derivative method for smooth stochastic convex optimization
- An accelerated method for derivative-free smooth stochastic convex optimization
- Gradient-free method for nonsmooth distributed optimization
- Derivative-free stochastic bilevel optimization for inverse problems
- A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems
- Dimension Free Nonasymptotic Bounds on the Accuracy of High-Dimensional Laplace Approximation
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
- Zeroth-order regularized optimization (ZORO): approximately sparse gradients and adaptive sampling
- Zeroth-order gradient and quasi-Newton methods for nonsmooth nonconvex stochastic optimization
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- A simple randomised algorithm for convex optimisation
- Accelerated gradient-free optimization methods with a non-Euclidean proximal operator
- Worst-case evaluation complexity of a derivative-free quadratic regularization method
- Nash equilibrium seeking in N-coalition games via a gradient-free method
- Direct search based on probabilistic descent
- Quasi-Newton method with subspace gradients
- Block coordinate type methods for optimization and learning
- Expected decrease for derivative-free algorithms using random subspaces
- A stochastic subspace approach to gradient-free optimization in high dimensions
- Direct Search Based on Probabilistic Descent in Reduced Spaces
- Robust design optimization for enhancing delamination resistance of composites
- Zeroth-order Riemannian averaging stochastic approximation algorithms
- Asymptotically Exact Data Augmentation: Models, Properties, and Algorithms
This page was built for publication: Random gradient-free minimization of convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397749)
