Introduction to Derivative-Free Optimization
From MaRDI portal
Publication:3611732
DOI10.1137/1.9780898718768zbMath1163.49001OpenAlexW181733065MaRDI QIDQ3611732
Andrew R. Conn, Katya Scheinberg, Luis Nunes Vicente
Publication date: 2 March 2009
Full work available at URL: https://doi.org/10.1137/1.9780898718768
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Related Items
On the numerical performance of finite-difference-based methods for derivative-free optimization, Full-low evaluation methods for derivative-free optimization, Surrogate‐based methods for black‐box optimization, Scalable subspace methods for derivative-free nonlinear least-squares optimization, Zeroth-order optimization with orthogonal random directions, A new black box method for monotone nonlinear equations, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, A nonlinear conjugate gradient method using inexact first-order information, Computationally efficient integrated design and predictive control of flexible energy systems using multi‐fidelity simulation‐based Bayesian optimization, Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization, Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact, Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs, Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem, Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities, A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization, Portfolio management with higher moments: the cardinality impact, Robust design optimization for enhancing delamination resistance of composites, Direct Search Based on Probabilistic Descent in Reduced Spaces, Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization, A quasi-Newton trust-region method for optimization under uncertainty using stochastic simplex approximate gradients, Accelerated gradient methods with absolute and relative noise in the gradient, Using orthogonally structured positive bases for constructing positive \(k\)-spanning sets with cosine measure guarantees, Hermite least squares optimization: a modification of BOBYQA for optimization with limited derivative information, A bi‐level programming framework for identifying optimal parameters in portfolio selection, Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions, TREGO: a trust-region framework for efficient global optimization, Consensus-based optimization via jump-diffusion stochastic differential equations, A merit function approach for evolution strategies, Two decades of blackbox optimization applications, Reduced modelling and optimal control of epidemiological individual‐based models with contact heterogeneity, Automated Deep Learning: Neural Architecture Search Is Not the End, Derivative-Free Optimization for Population Dynamic Models, On the complexity of a stochastic Levenberg-Marquardt method, A subset-selection-based derivative-free optimization algorithm for dynamic operation optimization in a steel-making process, Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems, Nicely structured positive bases with maximal cosine measure, Ensemble-Based Gradient Inference for Particle Methods in Optimization and Sampling, Pontryagin's maximum principle and indirect descent method for optimal impulsive control of nonlocal transport equation, Worst-case evaluation complexity of a derivative-free quadratic regularization method, A new partition method for DIRECT-type algorithm based on minimax design, A derivative-free optimization algorithm combining line-search and trust-region techniques, Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems, A derivative-free modified tensor method with curvilinear linesearch for unconstrained nonlinear programming, Unifying framework for accelerated randomized methods in convex optimization, Scalable Bayesian optimization with generalized product of experts, A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions, Recent Theoretical Advances in Non-Convex Optimization, A surrogate management framework using rigorous trust-region steps, Worst case complexity of direct search under convexity, A derivative-free approach for a simulation-based optimization problem in healthcare, Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Book review of: C. Audet and W. Hare, Derivative-free and blackbox optimization, Simulation optimization: a review of algorithms and applications, Direct Search Based on Probabilistic Descent, Manifold Sampling for $\ell_1$ Nonconvex Optimization, Calculus Identities for Generalized Simplex Gradients: Rules and Applications, Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases, A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients, A progressive barrier derivative-free trust-region algorithm for constrained optimization, On the optimal order of worst case complexity of direct search, Survey of derivative-free optimization, Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods, A discussion on variational analysis in derivative-free optimization, Stochastic derivative-free optimization using a trust region framework, Implicitly and densely discrete black-box optimization problems, Accelerated random search for constrained global optimization assisted by radial basis function surrogates, A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem, Information geometry approach to parameter estimation in Markov chains, Controlling first four moments for robust optimization, Global optimization using \(q\)-gradients, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Stochastic optimization using a trust-region method and random models, A global MINLP approach to symbolic regression, Calculation of the performance region of an easy-to-optimize alternative for generalized processor sharing, Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space, Numerical methods for computing plausibility and belief distributions of consequences of a subjective model of object of research, A derivative-free approximate gradient sampling algorithm for finite minimax problems, Optimization of black-box problems using Smolyak grids and polynomial approximations, Parallel distributed block coordinate descent methods based on pairwise comparison oracle, GOSAC: global optimization with surrogate approximation of constraints, Constrained multifidelity optimization using model calibration, Looking for the best constant in a Sobolev inequality: a numerical approach, Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework, Compositions of convex functions and fully linear models, On the convergence of trust region algorithms for unconstrained minimization without derivatives, Globally convergent evolution strategies for constrained optimization, Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions, Sobolev seminorm of quadratic functions with applications to derivative-free optimization, A mesh adaptive basin hopping method for the design of circular antenna arrays, On the construction of quadratic models for derivative-free trust-region algorithms, Nonsmooth spectral gradient methods for unconstrained optimization, Efficient use of parallelism in algorithmic parameter optimization applications, A short proof on the cardinality of maximal positive bases, Numerical simulation of polynomial-speed convergence phenomenon, Mesh adaptive direct search with second directional derivative-based Hessian update, Global convergence of trust-region algorithms for convex constrained minimization without derivatives, Calibrating a large computer experiment simulating radiative shock hydrodynamics, On the local convergence of a derivative-free algorithm for least-squares minimization, Analysis of direct searches for discontinuous functions, A deterministic global optimization using smooth diagonal auxiliary functions, Two-stage stochastic, large-scale optimization of a decentralized energy system: a case study focusing on solar PV, heat pumps and storage in a residential quarter, Beyond symmetric Broyden for updating quadratic models in minimization without derivatives, Order-based error for managing ensembles of surrogates in mesh adaptive direct search, Operations research in the space industry, A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization, Asynchronous gossip-based gradient-free method for multiagent optimization, An indicator for the switch from derivative-free to derivative-based optimization, On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure, Convergence analysis of the weighted state space search algorithm for recurrent neural networks, A variance-based method to rank input variables of the mesh adaptive direct search algorithm, Pattern search methods framework for beam angle optimization in radiotherapy design, Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems, An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming, Spatiotemporal interpolation through an extension of differential evolution algorithm for agricultural insurance claims, A direct search algorithm for global optimization, Inexact restoration method for nonlinear optimization without derivatives, Globally convergent evolution strategies, Optimization of algorithms with OPAL, Combining cross-entropy and MADS methods for inequality constrained global optimization, RBFOpt: an open-source library for black-box optimization with costly function evaluations, Calibration of parameters in dynamic energy budget models using direct-search methods, Boundary control of the number of interfaces for the one-dimensional Allen-Cahn equation, Conjugate gradient path method without line search technique for derivative-free unconstrained optimization, A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging, An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints, Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption, Kriging-assisted topology optimization of crash structures, CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method, Large-scale history matching with quadratic interpolation models, Empirical decision model learning, The singular value expansion of the Volterra integral equation associated to a numerical differentiation problem, Foveated nonlocal self-similarity, An inexact restoration derivative-free filter method for nonlinear programming, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, Automated parameterization of intermolecular pair potentials using global optimization techniques, A convergence analysis of the method of codifferential descent, MultiGLODS: global and local multiobjective optimization using direct search, A decomposition algorithm for unconstrained optimization problems with partial derivative information, The heterogeneous \(p\)-median problem for categorization based clustering, Globalization strategies for mesh adaptive direct search, Incorporating minimum Frobenius norm models in direct search, A derivative-free trust-region algorithm for composite nonsmooth optimization, Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization, Smoothing methods for nonsmooth, nonconvex minimization, A trust-region framework for real-time optimization with structural process-model mismatch, On the use of polynomial models in multiobjective directional direct search, Worst-case complexity bounds of directional direct-search methods for multiobjective optimization, Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates, Generating set search using simplex gradients for bound-constrained black-box optimization, On the properties of the cosine measure and the uniform angle subspace, An accelerated directional derivative method for smooth stochastic convex optimization, A multi-objective \textbf{DIRECT} algorithm for ship hull optimization, Inexact derivative-free optimization for bilevel learning, Worst case complexity of direct search, A globally convergent trust-region algorithm for unconstrained derivative-free optimization, A derivative-free trust region framework for variational data assimilation, An adaptive-topology ensemble algorithm for engineering optimization problems, Use of a biobjective direct search algorithm in the process design of material science applications, Optimizing damper connectors for adjacent buildings, A hybrid extended pattern search/genetic algorithm for multi-stage wind farm optimization, Using a derivative-free optimization method for multiple solutions of inverse transport problems, Optimization with hidden constraints and embedded Monte Carlo computations, MISO: mixed-integer surrogate optimization framework, On the properties of positive spanning sets and positive bases, Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization, Integration of expert knowledge into radial basis function surrogate models, Calibration by optimization without using derivatives, Use of reduced-order models in well control optimization, Identification of parameters for large-scale kinetic models, Use of static surrogates in hyperparameter optimization, ARGONAUT: algorithms for global optimization of constrained grey-box computational problems, Derivative-free trust region optimization for robust well control under geological uncertainty, Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference, Single-stage gradient-based stellarator coil design: optimization for near-axis quasi-symmetry, Exploiting active subspaces to quantify uncertainty in the numerical simulation of the hyshot II scramjet, Derivative-free methods for mixed-integer nonsmooth constrained optimization, FEqa: Finite element computations on quantum annealers, Efficient unconstrained black box optimization, Optimal 3D printing of complex objects in a \(5\)-axis printer, Zeroth-order algorithms for stochastic distributed nonconvex optimization, Constrained derivative-free optimization on thin domains, Derivative-free optimization: a review of algorithms and comparison of software implementations, A quasi-multistart framework for global optimization of expensive functions using response surface models, Quantifying uncertainty with ensembles of surrogates for blackbox optimization, Improved exploitation of higher order smoothness in derivative-free optimization, Zeroth-order methods for noisy Hölder-gradient functions, Random gradient-free minimization of convex functions, A Lagrangian propagator for artificial neural networks in constraint programming, A frame-based conjugate gradients direct search method with radial basis function interpolation model, An empirical study of derivative-free-optimization algorithms for targeted black-box attacks in deep neural networks, An adaptive direct multisearch method for black-box multi-objective optimization, Rate-optimal refinement strategies for local approximation MCMC, Incremental gradient-free method for nonsmooth distributed optimization, The Pontryagin maximum principle for solving Fokker-Planck optimal control problems, Computing proximal points of convex functions with inexact subgradients, Deterministic global derivative-free optimization of black-box problems with bounded Hessian, Direct search based on probabilistic feasible descent for bound and linearly constrained problems, Efficient calculation of regular simplex gradients, Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm, Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification, A deterministic algorithm to compute the cosine measure of a finite positive spanning set, Uniform simplex of an arbitrary orientation, Manifold learning for accelerating coarse-grained optimization, Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization, Kriging-sparse polynomial dimensional decomposition surrogate model with adaptive refinement, A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement, An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables, OLYMPUS optimization under geological uncertainty, Managing geological uncertainty in expensive reservoir simulation optimization, Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\), Decomposition in derivative-free optimization, A steepest descent method for set optimization problems with set-valued mappings of finite cardinality, Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization, Joint model of probabilistic-robust (probust) constraints applied to gas network optimization, DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems, How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem, Order statistics and region-based evolutionary computation, Derivative-free optimization via proximal point methods, Mesh adaptive direct search with simplicial Hessian update, Numerical optimization applying trust-region reflective least squares algorithm with constraints to optimize the non-linear creep parameters of soft soil, Derivative-free robust optimization by outer approximations, A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds, Black-box combinatorial optimization using models with integer-valued minima, DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization, A stochastic subspace approach to gradient-free optimization in high dimensions, A method for convex black-box integer global optimization, A derivative-free Gauss-Newton method, Derivative-free superiorization: principle and algorithm, A derivative-free algorithm for spherically constrained optimization, Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique, Expected complexity analysis of stochastic direct-search, Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization, Information geometry approach to parameter estimation in hidden Markov model, Non-linear data assimilation via trust region optimization, A derivative-free trust-region algorithm with copula-based models for probability maximization problems, Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations, Positive bases with maximal cosine measure, Dynamic improvements of static surrogates in direct search optimization, The regularized feasible directions method for nonconvex optimization, Derivative free methodologies for circuit worst case analysis, Approximating the diagonal of a Hessian: which sample set of points should be used, Efficiency of minimizing compositions of convex functions and smooth maps, Linear equalities in blackbox optimization, A derivative-free trust-funnel method for equality-constrained nonlinear optimization, Derivative-free methods for mixed-integer constrained optimization problems, Noisy zeroth-order optimization for non-smooth saddle point problems, Recovering a polyhedral obstacle by a few backscattering measurements, Recent advances in trust region algorithms, GLODS: global and local optimization using direct search, A wedge trust region method with self-correcting geometry for derivative-free optimization, Review and comparison of algorithms and software for mixed-integer derivative-free optimization, Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients, A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies, The calculus of simplex gradients, Control of dead-time systems using derivative free local search guided population based incremental learning algorithms, An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints, A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity, Bilevel derivative-free optimization and its application to robust optimization, Derivative-Free Bayesian Inversion Using Multiscale Dynamics, Model-Based Derivative-Free Methods for Convex-Constrained Optimization, STUDYING THE BASIN OF CONVERGENCE OF METHODS FOR COMPUTING PERIODIC ORBITS, Solving air traffic conflict problems via local continuous optimization, A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization, Adaptive Gradient-Free Method for Stochastic Optimization, Experimental Design for Nonparametric Correction of Misspecified Dynamical Models, A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization, Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation, Using first-order information in direct multisearch for multiobjective optimization, Multi-objective design optimization of antenna structures using sequential domain patching with automated patch size determination, Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method, A derivative-free comirror algorithm for convex optimization, Improving Direct Search algorithms by multilevel optimization techniques, A trust-region derivative-free algorithm for constrained optimization, Ensemble Gradient for Learning Turbulence Models from Indirect Observations, Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components, Exploiting Problem Structure in Derivative Free Optimization, Optimizing Network Topology for Cascade Resilience, Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning, ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization, A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results, Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models, An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization, Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions, Bayesian Optimization Via Barrier Functions, Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty, Surrogate-based distributed optimisation for expensive black-box functions, Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization, Escaping local minima with local derivative-free methods: a numerical investigation, Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization, Convergence of the Nelder-Mead method, Anisotropic Diffusion in Consensus-Based Optimization on the Sphere, Multifidelity approaches for optimization under uncertainty, A simulation-based optimization approach for the calibration of a discrete event simulation model of an emergency department, Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers, A derivative-free algorithm for non-linear optimization with linear equality constraints, Augmented Lagrangian Pattern Search Based Multi-Agent Model Predictive Control of Rhine-Meuse Delta, Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates, Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\), On Sampling Rates in Simulation-Based Recursions, Practical initialization of the Nelder-Mead method for computationally expensive optimization problems, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, On High-order Model Regularization for Constrained Optimization, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points, Parallel strategies for direct multisearch, Relax-and-split method for nonconvex inverse problems, SOCEMO: Surrogate Optimization of Computationally Expensive Multiobjective Problems, The Gauss-Newton Methods via Conjugate Gradient Path without Line Search Technique for Solving Nonlinear Systems, Penalty-free method for nonsmooth constrained optimization via radial basis functions, Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods, A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization, The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, A Modified Coordinate Search Method Based on Axes Rotation, Adaptive Numerical Designs for the Calibration of Computer Codes, Parallel Local Approximation MCMC for Expensive Models, Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis, Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework, A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling, Black-Box Optimization: Methods and Applications, The No Free Lunch Theorem: What Are its Main Implications for the Optimization Practice?, Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems, Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions, Surrogate-Based Methods, An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization, Global non-smooth optimization in robust multivariate regression, Use of quadratic models with mesh-adaptive direct search for constrained black box optimization, On the computation of relaxed pessimistic solutions to MPECs, Derivative-free optimization methods for finite minimax problems, A derivative-free algorithm for refining numerical microaggregation solutions, Trade-off studies in blackbox optimization, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, A trust-region-based derivative free algorithm for mixed integer programming, Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers, An Iterative Ensemble Kalman Smoother in Presence of Additive Model Error, A second-order globally convergent direct-search method and its worst-case complexity, Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints, Stochastic Three Points Method for Unconstrained Smooth Minimization, Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint, Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case, An active-set trust-region method for derivative-free nonlinear bound-constrained optimization, Derivative-free optimization methods, Parameter Estimation for Macroscopic Pedestrian Dynamics Models from Microscopic Data, Distributed Subgradient-Free Stochastic Optimization Algorithm for Nonsmooth Convex Functions over Time-Varying Networks, A Derivative-Free Method for Structured Optimization Problems, 1 Model reduction in chemical process optimization, Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise, A direct search approach to optimization for nonlinear model predictive control, Unnamed Item, Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms, Non-intrusive termination of noisy optimization, On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization, Optimization of Stochastic Blackboxes with Adaptive Precision, An affine-scaling derivative-free trust-region method for solving nonlinear systems subject to linear inequality constraints, CONORBIT: constrained optimization by radial basis function interpolation in trust regions, A Stochastic Simplex Approximate Gradient (StoSAG) for optimization under uncertainty
