Fetching the paper…
Reading the bibliography…
In many optimization problems arising from scientific, engineering and artificial intelligence applications, objective and constraint functions are available only as the output of a black-box or simulation oracle that does not provide derivative information.
G. Chandramouli and V. Narayanan · 1901
Earlier work this paper cites.
A stochastic derivative-free optimization method with importance sampling
A. Bibi, E. H. Bergou, O. Sener, B. Ghanem, and P. Richtárik · 1902
Earlier work this paper cites.
A method for convex black-box integer global optimization
J. Larson, S. Leyffer, P. Palkar, and S. M. Wild · 1903
Earlier work this paper cites.
NOWPAC: a provably convergent derivative-free nonlinear optimizer with path-augmented constraints
F. Augustin and Y. M. Marzouk · 1931
Earlier work this paper cites.
A method for the solution of certain non-linear problems in least squares
K. Levenberg · 1944
Earlier work this paper cites.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Stochastic estimation of the maximum of a regression function
J. Kiefer and J. Wolfowitz · 1952
Earlier work this paper cites.
Some aspects of the sequential design of experiments
H. Robbins · 1952
Earlier work this paper cites.
Theory of positive linear dependence
C. Davis · 1954
Earlier work this paper cites.
An application of Chung’s lemma to the Kiefer-Wolfowitz stochastic approximation procedure
C. Derman · 1956
Earlier work this paper cites.
A new generating set search algorithm for partially separable functions
L. Frimannslund and T. Steihaug · 1956
Earlier work this paper cites.
Asymptotic distribution of stochastic approximation procedures
J. Sacks · 1958
Earlier work this paper cites.
An automatic method for finding the greatest or least value of a function
H. H. Rosenbrock · 1960
Earlier work this paper cites.
“Direct search” solution of numerical and statistical problems
R. Hooke and T. A. Jeeves · 1961
Earlier work this paper cites.
Positive bases for linear spaces
R. L. McKinney · 1962
Earlier work this paper cites.
Sequential application of simplex designs in optimisation and evolutionary operation
W. Spendley, G. R. Hext, and F. R. Himsworth · 1962
Earlier work this paper cites.
An algorithm for least-squares estimation of nonlinear parameters
D. W. Marquardt · 1963
Earlier work this paper cites.
The convergence of the random search method in the extremal control of many-parameter system
L. A. Rastrigin · 1963
Earlier work this paper cites.
An efficient method for finding the minimum of a function of several variables without calculating derivatives
M. J. D. Powell · 1964
Earlier work this paper cites.
A new method of constrained optimization and a comparison with other methods
M. J. Box · 1965
Earlier work this paper cites.
Function minimization without evaluating derivatives – a review
R. Fletcher · 1965
Earlier work this paper cites.
Sequential search: A method for solving constrained optimization problems
H. Glass and L. Cooper · 1965
Earlier work this paper cites.
Random optimization
J. Matyas · 1965
Earlier work this paper cites.
A simplex method for function minimization
J. A. Nelder and R. Mead · 1965
Earlier work this paper cites.
A method for minimizing a sum of squares of non-linear functions without calculating derivatives
M. J. D. Powell · 1965
Earlier work this paper cites.
The solution of variational and boundary value problems by the method of local variations
N. V. Banichuk, V. M. Petrov, and F. L. Chernous’ko · 1966
Earlier work this paper cites.
A comparison of several current optimization methods, and the use of transformations in constrained problems
M. J. Box · 1966
Earlier work this paper cites.
Optimal condenser design by geometric programming
M. Avriel and D. J. Wilde · 1967
Earlier work this paper cites.
Nonlinear least squares fitting using a modified simplex minimization method
W. Spendley · 1969
Earlier work this paper cites.
Function and Functional Optimization by Interpolation in Data Tables
D. H. Winfield · 1969
Earlier work this paper cites.
A new method for minimising a sum of squares without calculating gradients
G. Peckham · 1970
Earlier work this paper cites.
Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation
K. M. Brown and J. E. Dennis, Jr · 1971
Earlier work this paper cites.
Optimisation: théorie et algorithmes
J. Céa · 1971
Earlier work this paper cites.
Stochastic approximation
V. Fabian · 1971
Earlier work this paper cites.
Computational Methods in Optimization: A Unified Approach , volume 77
E. Polak · 1971
Earlier work this paper cites.
Algorithms for Minimization Without Derivatives
R. P. Brent · 1973
Earlier work this paper cites.
Function minimization by interpolation in a data table
D. H. Winfield · 1973
Earlier work this paper cites.
Convergence estimates for iterative minimization methods
V. G. Karmanov · 1974
Earlier work this paper cites.
Linearly constrained nonlinear programming: a solution method that does not require analytic derivatives
J. H. May · 1974
Earlier work this paper cites.
Minimax solution of non-linear equations without calculating derivatives
K. Madsen · 1975
Earlier work this paper cites.
A superlinearly convergent algorithm for minimization without evaluating derivatives
R. Mifflin · 1975
Earlier work this paper cites.
A view of unconstrained minimization algorithms that do not require derivatives
M. J. D. Powell · 1975
Earlier work this paper cites.
Nonsmooth Optimization; Proceedings of an IIASA Workshop, March 28 - April 8, 1977 , 1978. Oxford: Pergamon Press
C. Lemarechal and R. Mifflin, editors · 1978
Earlier work this paper cites.
The Levenberg-Marquardt algorithm: Implementation and theory
J. J. Moré · 1978
Earlier work this paper cites.
Dud, a derivative-free algorithm for nonlinear least squares
M. L. Ralston and R. I. Jennrich · 1978
Earlier work this paper cites.
Rates of convergence for stochastic approximation type algorithms
H. J. Kushner and H. Huang · 1979
Earlier work this paper cites.
Solving nonlinear programs without using analytic derivatives
J. H. May · 1979
Earlier work this paper cites.
Positive basis and a class of direct search techniques
W.-c. Yu · 1979
Earlier work this paper cites.
Simplex direct search algorithms
A. S. Rykov · 1980
Earlier work this paper cites.
Practical Optimization
P. E. Gill, W. Murray, and M. H. Wright · 1981
Earlier work this paper cites.
A stochastic method for global optimization
C. G. E. Boender, A. H. G. Rinnooy Kan, G. T. Timmer, and L. Stougie · 1982
Earlier work this paper cites.
Computing forward-difference intervals for numerical optimization
P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright · 1983
Earlier work this paper cites.
Computing a trust region step
J. J. Moré and D. C. Sorensen · 1983
Earlier work this paper cites.
Stopping criteria for linesearch methods without derivatives
R. De Leone, M. Gaudioso, and L. Grippo · 1984
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
T. L. Lai and H. Robbins · 1985
Earlier work this paper cites.
An Interactive Approach for Solving Multi-Objective Optimization Problems
D. J. Woods · 1985
Earlier work this paper cites.
Conditions for convergence of trust region algorithms for nonsmooth optimization
Y.-x. Yuan · 1985
Earlier work this paper cites.
Scientific uses of the MANIAC
H. L. Anderson · 1986
Earlier work this paper cites.
Empirical Model Building and Response Surfaces
G. E. P. Box and N. R. Draper · 1987
Earlier work this paper cites.
Optimization on microcomputers: The Nelder-Mead simplex algorithm
J. E. Dennis, Jr. and D. J. Woods · 1987
Earlier work this paper cites.
Practical Methods of Optimization
R. Fletcher · 1987
Earlier work this paper cites.
Introduction to Optimization
B. T. Polyak · 1987
Earlier work this paper cites.
Two-point step size gradient methods
J. Barzilai and J. M. Borwein · 1988
Earlier work this paper cites.
Global convergence and stabilization of unconstrained minimization methods without derivatives
L. Grippo, F. Lampariello, and S. Lucidi · 1988
Earlier work this paper cites.
Bayesian Approach to Global Optimization: Theory and Applications
J. Mockus · 1989
Earlier work this paper cites.
Trust Region Algorithms for Optimization with Nonlinear Equality and Inequality Constraints
E. O. Omojokun · 1989
Earlier work this paper cites.
Pure adaptive search in Monte Carlo optimization
N. R. Patel, R. L. Smith, and Z. B. Zabinsky · 1989
Earlier work this paper cites.
Global Optimization
A. Törn and A. Žilinskas · 1989
Earlier work this paper cites.
A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds
A. R. Conn, N. I. M. Gould, and P. L. Toint · 1991
Earlier work this paper cites.
Direct search methods on parallel machines
J. E. Dennis, Jr. and V. Torczon · 1991
Earlier work this paper cites.
On the number of iterations of piyavskii’s global optimization algorithm
P. Hansen, B. Jaumard, and S.-H. Lu · 1991
Earlier work this paper cites.
Stochastic approximation
D. Ruppert · 1991
Earlier work this paper cites.
On the convergence of the multidirectional search algorithm
V. Torczon · 1991
Earlier work this paper cites.
Theory of Global Random Search
A. A. Zhigljavsky · 1991
Earlier work this paper cites.
Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
J. C. Spall · 1992
Earlier work this paper cites.
Pure adaptive search in global optimization
Z. B. Zabinsky and R. L. Smith · 1992
Earlier work this paper cites.
Lipschitzian optimization without the Lipschitz constant
D. R. Jones, C. D. Perttunen, and B. E. Stuckman · 1993
Earlier work this paper cites.
A direct search optimization method that models the objective and constraint functions by linear interpolation
M. J. D. Powell · 1994
Earlier work this paper cites.
Sample mean based index policies with o(log n) regret for the multi-armed bandit problem
R. Agrawal · 1995
Earlier work this paper cites.
A grid algorithm for bound constrained optimization of noisy functions
C. Elster and A. Neumaier · 1995
Earlier work this paper cites.
An implicit filtering algorithm for optimization of functions with many local minima
P. Gilmore and C. T. Kelley · 1995
Earlier work this paper cites.
Direct search methods: Once scorned, now respectable
M. H. Wright · 1995
Earlier work this paper cites.
Nelder-Mead simplex modifications for simulation optimization
R. R. Barton and J. S. Ivey, Jr · 1996
Earlier work this paper cites.
An algorithm using quadratic interpolation for unconstrained derivative free optimization
A. R. Conn and P. L. Toint · 1996
Earlier work this paper cites.
Managing approximation models in optimization
J. E. Dennis, Jr. and V. Torczon · 1997
Earlier work this paper cites.
Rate of convergence of moments of Spall’s SPSA method
L. Gerencsér · 1997
Earlier work this paper cites.
Trust region calculations revisited
M. J. D. Powell · 1997
Earlier work this paper cites.
On the convergence of pattern search algorithms
V. Torczon · 1997
Earlier work this paper cites.
A trust region framework for managing the use of approximation models in optimization
N. Alexandrov, J. E. Dennis, Jr., R. M. Lewis, and V. Torczon · 1998
Earlier work this paper cites.
The simplex gradient and noisy optimization problems
D. M. Bortz and C. T. Kelley · 1998
Earlier work this paper cites.
A derivative free optimization algorithm in practice
A. R. Conn, K. Scheinberg, and P. L. Toint · 1998
Earlier work this paper cites.
Efficient global optimization of expensive black-box functions
D. R. Jones, M. Schonlau, and W. J. Welch · 1998
Earlier work this paper cites.
Convergence properties of the Nelder-Mead simplex algorithm in low dimensions
J. C. Lagarias, J. A. Reeds, M. H. Wright, and P. E. Wright · 1998
Earlier work this paper cites.
Budget-dependent convergence rate of stochastic approximation
P. L’Ecuyer and G. Yin · 1998
Earlier work this paper cites.
Convergence of the Nelder-Mead simplex method to a nonstationary point
K. I. M. McKinnon · 1998
Earlier work this paper cites.
A rigorous framework for optimization of expensive functions by surrogates
A. J. Booker, J. E. Dennis, Jr., P. D. Frank, D. B. Serafini, V. Torczon, and M. W. Trosset · 1999
Earlier work this paper cites.
Global optimization by multilevel coordinate search
W. Huyer and A. Neumaier · 1999
Earlier work this paper cites.
Simulation-based optimization with stochastic approximation using common random numbers
N. L. Kleinman, J. C. Spall, and D. Q. Naiman · 1999
Earlier work this paper cites.
Pattern search algorithms for bound constrained minimization
R. M. Lewis and V. Torczon · 1999
Earlier work this paper cites.
Fortified-descent simplicial search method: A general approach
P. Tseng · 1999
Earlier work this paper cites.
Pattern search algorithms for mixed variable programming
C. Audet and J. E. Dennis, Jr · 2000
Earlier work this paper cites.
Global optimization of costly nonconvex functions using radial basis functions
M. Björkman and K. Holmström · 2000
Earlier work this paper cites.
Radial basis functions
M. D. Buhmann · 2000
Earlier work this paper cites.
Superlinear convergence and implicit filtering
T. D. Choi and C. T. Kelley · 2000
Earlier work this paper cites.
Optimization of automotive valve train components with implicit filtering
T. D. Choi, O. J. Eslinger, C. T. Kelley, J. W. David, and M. Etheridge · 2000
Earlier work this paper cites.
Trust-Region Methods
A. R. Conn, N. I. M. Gould, and P. L. Toint · 2000
Earlier work this paper cites.
Frame based methods for unconstrained optimization
I. D. Coope and C. J. Price · 2000
Earlier work this paper cites.
Pattern search methods for linearly constrained minimization
R. M. Lewis and V. Torczon · 2000
Earlier work this paper cites.
Direct search methods: Then and now
R. M. Lewis, V. Torczon, and M. W. Trosset · 2000
Earlier work this paper cites.
A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
D.-H. Li and M. Fukushima · 2000
Earlier work this paper cites.
A multigrid approach to discretized optimization problems
S. G. Nash · 2000
Earlier work this paper cites.
Algorithms for noisy problems in gas transmission pipeline optimization
R. G. Carter, J. M. Gablonsky, A. Patrick, C. T. Kelley, and O. J. Eslinger · 2001
Earlier work this paper cites.
Stochastic root finding via retrospective approximation
H. Chen and B. W. Schmeiser · 2001
Earlier work this paper cites.
Exploiting band structure in unconstrained optimization without derivatives
B. Colson and P. L. Toint · 2001
Earlier work this paper cites.
DFO (derivative free optimization software)
A. R. Conn, K. Scheinberg, and P. L. Toint · 2001
Earlier work this paper cites.
A radial basis function method for global optimization
H.-M. Gutmann · 2001
Earlier work this paper cites.
Asynchronous parallel pattern search for nonlinear optimization
P. D. Hough, T. G. Kolda, and V. Torczon · 2001
Earlier work this paper cites.
On the Lagrange functions of quadratic models that are defined by interpolation
M. J. D. Powell · 2001
Earlier work this paper cites.
Analysis of generalized pattern searches
C. Audet and J. E. Dennis, Jr · 2002
Earlier work this paper cites.
Using confidence bounds for exploitation-exploration trade-offs
P. Auer · 2002
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, and P. Fischer · 2002
Earlier work this paper cites.
A derivative-free algorithm for sparse unconstrained optimization problems
B. Colson and P. L. Toint · 2002
Earlier work this paper cites.
New sequential and parallel derivative-free algorithms for unconstrained minimization
U. M. García-Palomares and J. F. Rodríguez · 2002
Earlier work this paper cites.
A class of trust-region methods for parallel optimization
P. D. Hough and J. C. Meza · 2002
Earlier work this paper cites.
On metrics for comparing nondominated sets
J. Knowles and D. Corne · 2002
Earlier work this paper cites.
A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds
R. M. Lewis and V. Torczon · 2002
Earlier work this paper cites.
Objective-derivative-free methods for constrained optimization
S. Lucidi, M. Sciandrone, and P. Tseng · 2002
Earlier work this paper cites.
Wedge trust region methods for derivative free optimization
M. Marazzi and J. Nocedal · 2002
Earlier work this paper cites.
Gilding the lily: A variant of the Nelder-Mead algorithm based on golden-section search
L. Nazareth and P. Tseng · 2002
Earlier work this paper cites.
UOBYQA: unconstrained optimization by quadratic approximation
M. J. D. Powell · 2002
Earlier work this paper cites.
A convergent variant of the Nelder-Mead algorithm
C. J. Price, I. D. Coope, and D. Byatt · 2002
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire · 2003
Earlier work this paper cites.
Constrained optimization involving expensive function evaluations: A sequential approach
R. Brekelmans, L. Driessen, H. Hamers, and D. den Hertog · 2003
Earlier work this paper cites.
On the local convergence of pattern search
E. D. Dolan, R. M. Lewis, and V. Torczon · 2003
Earlier work this paper cites.
A mathematical view of automatic differentiation
A. Griewank · 2003
Earlier work this paper cites.
Implicit filtering and nonlinear least squares problems
C. T. Kelley · 2003
Earlier work this paper cites.
Optimization by direct search: New perspectives on some classical and modern methods
T. G. Kolda, R. M. Lewis, and V. Torczon · 2003
Earlier work this paper cites.
Stochastic Approximation and Recursive Algorithms and Applications
H. J. Kushner and G. Yin · 2003
Earlier work this paper cites.
On trust region methods for unconstrained minimization without derivatives
M. J. D. Powell · 2003
Earlier work this paper cites.
MAPO: using a committee of algorithm-experts for parallel optimization of costly functions
C. A. Shoemaker and R. G. Regis · 2003
Cited alongside, same era.
Generalized pattern searches with derivative information
M. A. Abramson, C. Audet, and J. E. Dennis, Jr · 2004
Cited alongside, same era.
Convergence results for generalized pattern search algorithms are tight
C. Audet · 2004
Cited alongside, same era.
A pattern search filter method for nonlinear programming without derivatives
C. Audet and J. E. Dennis, Jr · 2004
Cited alongside, same era.
Convergence analysis of the DIRECT algorithm
D. E. Finkel and C. T. Kelley · 2004
Cited alongside, same era.
A globally convergent filter method for nonlinear programming
C. C. Gonzaga, E. W. Karas, and M. Vanti · 2004
Cited alongside, same era.
Exploiting known structures to approximate normal cones
C. Davis and W. L. Hare · 2013
Later among the works it cites.
Coordinate search algorithms in multilevel optimization
E. Frandi and A. Papini · 2013
Later among the works it cites.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
S. Ghadimi and G. Lan · 2013
Later among the works it cites.
Derivative-free optimization via proximal point methods
W. L. Hare and Y. Lucet · 2013
Later among the works it cites.
A derivative-free approximate gradient sampling algorithm for finite minimax problems
W. L. Hare and J. Nutini · 2013
Later among the works it cites.
Stochastic approximation
D. W. Hutchison and J. C. Spall · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the convergence of the UOBYQA method
L. Han and G. Liu · 2004
Cited alongside, same era.
Introductory Lectures on Convex Optimization: A Basic Course , volume 87 of
Y. Nesterov · 2004
Cited alongside, same era.
Complete search in continuous global optimization and constraint satisfaction
A. Neumaier · 2004
Cited alongside, same era.
On updating the inverse of a KKT matrix
M. J. D. Powell · 2004
Cited alongside, same era.
CONDOR: A Constrained, Non-Linear, Derivative-Free Parallel Optimizer for Continuous, High Computing Load, Noisy Objective Functions
F. Vanden Berghen · 2004
Cited alongside, same era.
CONDOR, a new parallel, constrained extension of Powell’s UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
F. Vanden Berghen and H. Bersini · 2004
Cited alongside, same era.
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
M. J. D. Powell · 2013
Later among the works it cites.
Constrained optimization by radial basis function interpolation for high-dimensional expensive black-box problems with infeasible initial points
R. G. Regis · 2013
Later among the works it cites.
Derivative-free optimization: a review of algorithms and comparison of software implementations
L. M. Rios and N. V. Sahinidis · 2013
Later among the works it cites.
On the complexity of bandit and derivative-free stochastic convex optimization
O. Shamir · 2013
Later among the works it cites.
Optimization of convex functions with random pursuit
S. U. Stich, C. L. Müller, and B. Gärtner · 2013
Later among the works it cites.
Stochastic simultaneous optimistic optimization
M. Valko, A. Carpentier, and R. Munos · 2013
Later among the works it cites.
Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions
B. Van Dyke and T. J. Asaki · 2013
Later among the works it cites.
Worst case complexity of direct search
L. N. Vicente · 2013
Later among the works it cites.
Global convergence of radial basis function trust-region algorithms for derivative-free optimization
S. M. Wild and C. A. Shoemaker · 2013
Later among the works it cites.
A survey on direct search methods for blackbox optimization and their applications
C. Audet · 2014
Later among the works it cites.
Reducing the number of function evaluations in mesh adaptive direct search algorithms
C. Audet, A. Ianni, S. Le Digabel, and C. Tribes · 2014
Later among the works it cites.
Convergence of trust-region methods based on probabilistic models
A. S. Bandeira, K. Scheinberg, and L. N. Vicente · 2014
Later among the works it cites.
A derivative-free comirror algorithm for convex optimization
H. H. Bauschke, W. L. Hare, and W. M. Moursi · 2014
Later among the works it cites.
A linesearch-based derivative-free approach for nonsmooth constrained optimization
G. Fasano, G. Liuzzi, S. Lucidi, and F. Rinaldi · 2014
Later among the works it cites.
A merit function approach for direct search
S. Gratton and L. N. Vicente · 2014
Later among the works it cites.
A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
L. Grippo and F. Rinaldi · 2014
Later among the works it cites.
A derivative-free algorithm for linearly constrained optimization problems
E. A. E. Gumma, M. H. A. Hashim, and M. M. Ali · 2014
Later among the works it cites.
Stochastic finite element methods for partial differential equations with random input data
M. D. Gunzburger, C. G. Webster, and G. Zhang · 2014
Later among the works it cites.
Numerical analysis of
W. L. Hare · 2014
Later among the works it cites.
Logistic regression: Tight bounds for stochastic and online optimization
E. Hazan, T. Koren, and K. Y. Levy · 2014
Later among the works it cites.
Monte Carlo sampling-based methods for stochastic optimization
T. Homem-de-Mello and G. Bayraksan · 2014
Later among the works it cites.
Simple complexity analysis of simplified direct search
J. Konečný and P. Richtárik · 2014
Later among the works it cites.
Cokriging-based sequential design strategies using fast cross-validation techniques for multi-fidelity computer codes
L. Le Gratiet and C. Cannamela · 2014
Later among the works it cites.
Do you trust derivatives or differences?
J. J. Moré and S. M. Wild · 2014
Later among the works it cites.
Methods for Network Optimization and Parallel Derivative-Free Optimization
P.-M. Olsson · 2014
Later among the works it cites.
A derivative-free trust-region method for biobjective optimization
J.-h. Ryu and S. Kim · 2014
Later among the works it cites.
Sobolev seminorm of quadratic functions with applications to derivative-free optimization
Z. Zhang · 2014
Later among the works it cites.
Linear equalities in blackbox optimization
C. Audet, S. Le Digabel, and M. Peyrega · 2015
Later among the works it cites.
Escaping the local minima via simulated annealing: Optimization of approximately convex functions
A. Belloni, T. Liang, H. Narayanan, and A. Rakhlin · 2015
Later among the works it cites.
Mesh adaptive direct search with second directional derivative-based Hessian update
Á. Bűrmen, J. Olenšek, and T. Tuma · 2015
Later among the works it cites.
Stochastic Derivative-Free Optimization of Noisy Functions
R. Chen · 2015
Later among the works it cites.
Derivative-free robust optimization for circuit design
A. Ciccazzo, V. Latorre, G. Liuzzi, S. Lucidi, and F. Rinaldi · 2015
Later among the works it cites.
A trust-region derivative-free algorithm for constrained optimization
P. D. Conejo, E. W. Karas, and L. G. Pedroso · 2015
Later among the works it cites.
GLODS: Global and local optimization using direct search
A. L. Custódio and J. F. A. Madeira · 2015
Later among the works it cites.
Bandit smooth convex optimization: Improving the bias-variance tradeoff
O. Dekel, R. Eldan, and T. Koren · 2015
Later among the works it cites.
Optimal rates for zero-order convex optimization: The power of two function evaluations
J. C. Duchi, M. I. Jordan, M. J. Wainwright, and A. Wibisono · 2015
Later among the works it cites.
An inexact restoration derivative-free filter method for nonlinear programming
N. Echebest, M. L. Schuverdt, and R. P. Vignau · 2015
Later among the works it cites.
The mesh adaptive direct search algorithm with treed Gaussian process surrogates
R. B. Gramacy and S. Le Digabel · 2015
Later among the works it cites.
Direct search based on probabilistic descent
S. Gratton, C. W. Royer, L. N. Vicente, and Z. Zhang · 2015
Later among the works it cites.
A second-order globally convergent direct-search method and its worst-case complexity
S. Gratton, C. W. Royer, and L. N. Vicente · 2015
Later among the works it cites.
A guide to sample average approximation
S. Kim, R. Pasupathy, and S. G. Henderson · 2015
Later among the works it cites.
A taxonomy of constraints in black-box simulation-based optimization
S. Le Digabel and S. M. Wild · 2015
Later among the works it cites.
It’s to solve problems: An interview with Roger Fletcher
S. Leyffer · 2015
Later among the works it cites.
MrDIRECT: A multilevel robust DIRECT algorithm for global optimization problems
Q. Liu, J. Zeng, and G. Yang · 2015
Later among the works it cites.
Derivative-free methods for mixed-integer constrained optimization problems
G. Liuzzi, S. Lucidi, and F. Rinaldi · 2015
Later among the works it cites.
A trust-region-based derivative free algorithm for mixed integer programming
E. Newby and M. M. Ali · 2015
Later among the works it cites.
On fast trust region methods for quadratic models with linear constraints
M. J. D. Powell · 2015
Later among the works it cites.
The calculus of simplex gradients
R. G. Regis · 2015
Later among the works it cites.
A derivative-free trust-funnel method for equality-constrained nonlinear optimization
P. R. Sampaio and P. L. Toint · 2015
Later among the works it cites.
Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
P. R. Sampaio and P. L. Toint · 2015
Later among the works it cites.
Taking the human out of the loop: A review of Bayesian optimization
B. Shahriari, K. Swersky, Z. Wang, R. P. Adams, and N. de Freitas · 2015
Later among the works it cites.
Online bandit learning for a special class of non-convex losses
L. Zhang, T. Yang, R. Jin, and Z.-H. Zhou · 2015
Later among the works it cites.
Highly-smooth zero-th order online optimization
F. Bach and V. Perchet · 2016
Later among the works it cites.
Optimization with hidden constraints and embedded Monte Carlo computations
X. Chen and C. T. Kelley · 2016
Later among the works it cites.
MultiGLODS: Global and local multiobjective optimization using direct search
A. L. Custódio and J. F. A. Madeira · 2016
Later among the works it cites.
MILP models for the selection of a small set of well-distributed points
C. D’Ambrosio, G. Nannicini, and G. Sartor · 2016
Later among the works it cites.
Worst case complexity of direct search under convexity
M. Dodangeh and L. N. Vicente · 2016
Later among the works it cites.
On the optimal order of worst case complexity of direct search
M. Dodangeh, L. N. Vicente, and Z. Zhang · 2016
Later among the works it cites.
Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
P. S. Ferreira, E. W. Karas, M. Sachine, and F. N. C. Sobral · 2016
Later among the works it cites.
Trust-region methods without using derivatives: Worst case complexity and the nonsmooth case
R. Garmanjani, D. Jùdice, and L. N. Vicente · 2016
Later among the works it cites.
A derivative-free trust-region algorithm for composite nonsmooth optimization
G. N. Grapiglia, J. Yuan, and Y.-x. Yuan · 2016
Later among the works it cites.
On Lipschitz optimization based on gray-box piecewise linearization
A. Griewank, A. Walther, S. Fiege, and T. Bosse · 2016
Later among the works it cites.
Zeroth-order asynchronous doubly stochastic algorithm with variance reduction
B. Gu, Z. Huo, and H. Huang · 2016
Later among the works it cites.
(bandit) convex optimization with biased noisy gradient oracles
X. Hu, L. A. Prashanth, A. György, and C. Szepesvári · 2016
Later among the works it cites.
Stochastic derivative-free optimization using a trust region framework
J. Larson and S. C. Billups · 2016
Later among the works it cites.
A batch, derivative-free algorithm for finding multiple local minima
J. Larson and S. M. Wild · 2016
Later among the works it cites.
Manifold sampling for
J. Larson, M. Menickelly, and S. M. Wild · 2016
Later among the works it cites.
Calibration by optimization without using derivatives
M. Lazar and F. Jarre · 2016
Later among the works it cites.
A derivative-free approach to constrained multiobjective nonsmooth optimization
G. Liuzzi, S. Lucidi, and F. Rinaldi · 2016
Later among the works it cites.
MISO: Mixed-integer surrogate optimization framework
J. Müller · 2016
Later among the works it cites.
Bayesian optimization under mixed constraints with a slack-variable augmented Lagrangian
V. Picheny, R. B. Gramacy, S. M. Wild, and S. Le Digabel · 2016
Later among the works it cites.
Combining Multivariate Stochastic Process Models with Filter Methods for Constrained Optimization
T. Pourmohamad · 2016
Later among the works it cites.
Stochastic variance reduction for nonconvex optimization
S. J. Reddi, A. Hefny, S. Sra, B. Poczos, and A. Smola · 2016
Later among the works it cites.
On the properties of positive spanning sets and positive bases
R. G. Regis · 2016
Later among the works it cites.
CONORBIT: Constrained optimization by radial basis function interpolation in trust regions
R. G. Regis and S. M. Wild · 2016
Later among the works it cites.
An information-theoretic analysis of Thompson sampling
D. Russo and B. Van Roy · 2016
Later among the works it cites.
ASTRO-DF: Adaptive sampling trust-region optimization algorithms, heuristics, and numerical experience
S. Shashaani, S. R. Hunter, and R. Pasupathy · 2016
Later among the works it cites.
A sequential quadratic programming algorithm for equality-constrained optimization without derivatives
A. Tröltzsch · 2016
Later among the works it cites.
Surrogate-based methods for black-box optimization
K. K. Vu, C. D’Ambrosio, Y. Hamadi, and L. Liberti · 2016
Later among the works it cites.
Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
N. Amaioua, C. Audet, A. R. Conn, and S. Le Digabel · 2017
Later among the works it cites.
Derivative-Free and Blackbox Optimization
C. Audet and W. L. Hare · 2017
Later among the works it cites.
A trust-region method for derivative-free nonlinear constrained stochastic optimization
F. Augustin and Y. M. Marzouk · 2017
Later among the works it cites.
A trust region-based two phase algorithm for constrained black-box and grey-box optimization with infeasible initial point
I. Bajaj, S. S. Iyer, and M. M. F. Hasan · 2017
Later among the works it cites.
Kernel-based methods for bandit convex optimization
S. Bubeck, Y. T. Lee, and R. Eldan · 2017
Later among the works it cites.
An effective algorithm for hyperparameter optimization of neural networks
G. I. Diaz, A. Fokoue-Nkoutche, G. Nannicini, and H. Samulowitz · 2017
Later among the works it cites.
Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case
A. V. Gasnikov, E. A. Krymova, A. A. Lagunovskaya, I. N. Usmanova, and F. A. Fedorenko · 2017
Later among the works it cites.
Google Vizier: A service for black-box optimization
D. Golovin, B. Solnik, S. Moitra, G. Kochanski, J. Karro, and D. Sculley · 2017
Later among the works it cites.
Compositions of convex functions and fully linear models
W. L. Hare · 2017
Later among the works it cites.
Efficient hyperparameter optimization for deep learning algorithms using deterministic RBF surrogates
I. Ilievski, T. Akhtar, J. Feng, and C. A. Shoemaker · 2017
Later among the works it cites.
Random Models in Nonlinear Optimization
M. Menickelly · 2017
Later among the works it cites.
GOSAC: Global optimization with surrogate approximation of constraints
J. Müller and J. D. Woodbury · 2017
Later among the works it cites.
Random gradient-free minimization of convex functions
Y. Nesterov and V. Spokoiny · 2017
Later among the works it cites.
BFO, a trainable derivative-free brute force optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables
M. Porcelli and P. L. Toint · 2017
Later among the works it cites.
Fast black-box variational inference through stochastic trust-region optimization
J. Regier, M. I. Jordan, and J. McAuliffe · 2017
Later among the works it cites.
An optimal algorithm for bandit and zero-order convex optimization with two-point feedback
O. Shamir · 2017
Later among the works it cites.
On the construction of quadratic models for derivative-free trust-region algorithms
A. Verdério, E. W. Karas, L. G. Pedroso, and K. Scheinberg · 2017
Later among the works it cites.
Solving derivative-free nonlinear least squares problems with POUNDERS
S. M. Wild · 2017
Later among the works it cites.
Algebraic multigrid methods
J. Xu and L. Zikatanov · 2017
Later among the works it cites.
Selection of variables in parallel space decomposition for the mesh adaptive direct search algorithm
S. Alarie, N. Amaioua, C. Audet, S. Le Digabel, and L.-A. Leclaire · 2018
Later among the works it cites.
Performance indicators in multiobjective optimization
C. Audet, J. Bigeon, D. Cartier, S. Le Digabel, and L. Salomon · 2018
Later among the works it cites.
DeepHyper: Asynchronous hyperparameter search for deep neural networks
P. Balaprakash, M. Salim, T. D. Uram, V. Vishwanath, and S. M. Wild · 2018
Later among the works it cites.
Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates
K. Balasubramanian and S. Ghadimi · 2018
Later among the works it cites.
Automatic differentiation in machine learning: A survey
A. G. Baydin, B. A. Pearlmutter, A. A. Radul, and J. M. Siskind · 2018
Later among the works it cites.
Optimization methods for large-scale machine learning
L. Bottou, F. E. Curtis, and J. Nocedal · 2018
Later among the works it cites.
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
C. Cartis and K. Scheinberg · 2018
Later among the works it cites.
An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints
G. Cocchi, G. Liuzzi, A. Papini, and M. Sciandrone · 2018
Later among the works it cites.
TAO 3.10 users manual
A. Dener, A. Denchfield, T. Munson, J. Sarich, S. M. Wild, S. Benson, and L. Curfman McInnes · 2018
Later among the works it cites.
An accelerated method for derivative-free smooth stochastic convex optimization
P. Dvurechensky, A. V. Gasnikov, and E. Gorbunov · 2018
Later among the works it cites.
A tutorial on Bayesian optimization
P. I. Frazier · 2018
Later among the works it cites.
Complexity and global rates of trust-region methods based on probabilistic models
S. Gratton, C. W. Royer, L. N. Vicente, and Z. Zhang · 2018
Later among the works it cites.
Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
K. A. Khan, J. Larson, and S. M. Wild · 2018
Later among the works it cites.
Asynchronously parallel optimization solver for finding multiple minima
J. Larson and S. M. Wild · 2018
Later among the works it cites.
Zeroth-order stochastic variance reduction for nonconvex optimization
S. Liu, B. Kailkhura, P.-Y. Chen, P. Ting, S. Chang, and L. Amini · 2018
Later among the works it cites.
An algorithmic framework based on primitive directions and nonmonotone line searches for black box problems with integer variables
G. Liuzzi, S. Lucidi, and F. Rinaldi · 2018
Later among the works it cites.
A derivative-free trust-region algorithm for the optimization of functions smoothed via Gaussian convolution using adaptive multiple importance sampling
A. Maggiar, A. Wächter, I. S. Dolinskaya, and J. Staum · 2018
Later among the works it cites.
Approximate norm descent methods for constrained nonlinear systems
B. Morini, M. Porcelli, and P. L. Toint · 2018
Later among the works it cites.
A stochastic line search method with convergence rate analysis
C. Paquette and K. Scheinberg · 2018
Later among the works it cites.
On sampling rates in simulation-based recursions
R. Pasupathy, P. Glynn, S. Ghosh, and F. S. Hashemi · 2018
Later among the works it cites.
ASTRO-DF: A class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
S. Shashaani, F. S. Hashemi, and R. Pasupathy · 2018
Later among the works it cites.
Stochastic zeroth-order optimization in high dimensions
Y. Wang, S. S. Du, S. Balakrishnan, and A. Singh · 2018
Later among the works it cites.
Simulation optimization: a review of algorithms and applications
S. Amaran, N. V. Sahinidis, B. Sharda, and S. J. Bury · 2019
Closest in time.
K. Balasubramanian and S. Ghadimi · 2019
Closest in time.
Derivative-free optimization of noisy functions via quasi-Newton methods
A. S. Berahas, R. H. Byrd, and J. Nocedal · 2019
Closest in time.
Convergence rate analysis of a stochastic trust region method via submartingales
J. Blanchet, C. Cartis, M. Menickelly, and K. Scheinberg · 2019
Closest in time.
Gradient sampling methods for nonsmooth optimization
J. V. Burke, F. E. Curtis, A. S. Lewis, M. L. Overton, and L. E. A. Simões · 2019
Closest in time.
A derivative-free Gauss-Newton method
C. Cartis and L. Roberts · 2019
Closest in time.
Efficient calculation of regular simplex gradients
I. D. Coope and R. Tappenden · 2019
Closest in time.
Conditional gradient type methods for composite nonlinear and stochastic optimization
S. Ghadimi · 2019
Closest in time.
W. L. Hare, C. Planiden, and C. Sagastizábal · 2019
Closest in time.
Derivative free methodologies for circuit worst case analysis
V. Latorre, H. Habal, H. Graeb, and S. Lucidi · 2019
Closest in time.
Derivative-free robust optimization by outer approximations
M. Menickelly and S. M. Wild · 2019
Closest in time.
Surrogate optimization of computationally expensive black-box problems with hidden constraints
J. Müller and M. Day · 2019
Closest in time.
Numerical solution of a minimum problem
E. Fermi and N. Metropolis · 2027
Closest in time.