Pages that link to "Item:Q2397749"

The following pages link to Random gradient-free minimization of convex functions (Q2397749):

Displaying 50 items.

• Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
• On the computation of equilibria in monotone and potential stochastic hierarchical games (Q2693642) (← links)
• Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points (Q2696568) (← links)
• Trust-region methods without using derivatives: worst case complexity and the nonsmooth case (Q2826817) (← links)
• Optimization of convex functions with random pursuit (Q2848195) (← links)
• (Q2995636) (← links)
• A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization (Q3174787) (← links)
• Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains (Q3187981) (← links)
• Efficient Convex Optimization with Oracles (Q3295271) (← links)
• Minimization Algorithms for Functions with Random Noise (Q3339195) (← links)
• Randomized Iterative Methods for Linear Systems (Q3456879) (← links)
• Stochastic Model-Based Minimization of Weakly Convex Functions (Q4620418) (← links)
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods (Q4634094) (← links)
• Gradient-Free Methods with Inexact Oracle for Convex-Concave Stochastic Saddle-Point Problem (Q4965105) (← links)
• Stochastic Three Points Method for Unconstrained Smooth Minimization (Q4971022) (← links)
• Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise (Q4997171) (← links)
• (Q4999102) (← links)
• A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems (Q5005000) (← links)
• A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization (Q5026838) (← links)
• New First-Order Algorithms for Stochastic Variational Inequalities (Q5051379) (← links)
• (Q5054636) (← links)
• Finite Difference Gradient Approximation: To Randomize or Not? (Q5057983) (← links)
• Adaptive Tikhonov strategies for stochastic ensemble Kalman inversion (Q5062131) (← links)
• Asymptotically Exact Data Augmentation: Models, Properties, and Algorithms (Q5066390) (← links)
• Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning (Q5071109) (← links)
• Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization (Q5072586) (← links)
• Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling (Q5072595) (← links)
• An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
• A New Likelihood Ratio Method for Training Artificial Neural Networks (Q5084674) (← links)
• Pathological Subgradient Dynamics (Q5110559) (← links)
• (Q5159454) (← links)
• Tuning of multivariable model predictive controllers through expert bandit feedback (Q5165276) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Distributed Subgradient-Free Stochastic Optimization Algorithm for Nonsmooth Convex Functions over Time-Varying Networks (Q5232244) (← links)
• Direct Search Based on Probabilistic Descent (Q5502242) (← links)
• On the numerical performance of finite-difference-based methods for derivative-free optimization (Q5882235) (← links)
• Full-low evaluation methods for derivative-free optimization (Q5882241) (← links)
• Block coordinate type methods for optimization and learning (Q5889894) (← links)
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization (Q5962719) (← links)
• Worst case complexity of direct search under convexity (Q5962720) (← links)
• Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
• Zeroth-order optimization with orthogonal random directions (Q6038668) (← links)
• A trust region method for noisy unconstrained optimization (Q6052069) (← links)
• Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact (Q6060544) (← links)
• Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs (Q6060563) (← links)
• Dimension Free Nonasymptotic Bounds on the Accuracy of High-Dimensional Laplace Approximation (Q6062239) (← links)
• Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities (Q6064044) (← links)
• A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization (Q6066421) (← links)
• A gradient‐free distributed optimization method for convex sum of nonconvex cost functions (Q6069332) (← links)
• Robust design optimization for enhancing delamination resistance of composites (Q6071390) (← links)