Pages that link to "Item:Q3611732"

The following pages link to Introduction to Derivative-Free Optimization (Q3611732):

Displaying 50 items.

• Black-box combinatorial optimization using models with integer-valued minima (Q2043440) (← links)
• DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization (Q2044473) (← links)
• A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
• A method for convex black-box integer global optimization (Q2045020) (← links)
• Derivative-free superiorization: principle and algorithm (Q2048824) (← links)
• Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique (Q2061776) (← links)
• Expected complexity analysis of stochastic direct-search (Q2070336) (← links)
• Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization (Q2070360) (← links)
• Information geometry approach to parameter estimation in hidden Markov model (Q2073215) (← links)
• A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
• Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations (Q2082542) (← links)
• The regularized feasible directions method for nonconvex optimization (Q2084025) (← links)
• Approximating the diagonal of a Hessian: which sample set of points should be used (Q2084264) (← links)
• Noisy zeroth-order optimization for non-smooth saddle point problems (Q2104286) (← links)
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization (Q2114591) (← links)
• Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients (Q2114826) (← links)
• A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies (Q2115032) (← links)
• Identification of parameters for large-scale kinetic models (Q2120051) (← links)
• Use of static surrogates in hyperparameter optimization (Q2120124) (← links)
• Derivative-free trust region optimization for robust well control under geological uncertainty (Q2130973) (← links)
• Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference (Q2137043) (← links)
• Single-stage gradient-based stellarator coil design: optimization for near-axis quasi-symmetry (Q2137950) (← links)
• Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
• FEqa: Finite element computations on quantum annealers (Q2142201) (← links)
• Efficient unconstrained black box optimization (Q2146451) (← links)
• Optimal 3D printing of complex objects in a \(5\)-axis printer (Q2147940) (← links)
• Zeroth-order algorithms for stochastic distributed nonconvex optimization (Q2151863) (← links)
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
• Improved exploitation of higher order smoothness in derivative-free optimization (Q2162687) (← links)
• Zeroth-order methods for noisy Hölder-gradient functions (Q2162695) (← links)
• An empirical study of derivative-free-optimization algorithms for targeted black-box attacks in deep neural networks (Q2168625) (← links)
• An adaptive direct multisearch method for black-box multi-objective optimization (Q2168631) (← links)
• Rate-optimal refinement strategies for local approximation MCMC (Q2172107) (← links)
• The Pontryagin maximum principle for solving Fokker-Planck optimal control problems (Q2181601) (← links)
• Deterministic global derivative-free optimization of black-box problems with bounded Hessian (Q2182783) (← links)
• Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
• Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification (Q2191793) (← links)
• A deterministic algorithm to compute the cosine measure of a finite positive spanning set (Q2192976) (← links)
• Uniform simplex of an arbitrary orientation (Q2192988) (← links)
• Manifold learning for accelerating coarse-grained optimization (Q2194441) (← links)
• Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization (Q2209727) (← links)
• Kriging-sparse polynomial dimensional decomposition surrogate model with adaptive refinement (Q2214537) (← links)
• A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) (← links)
• An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables (Q2220918) (← links)
• OLYMPUS optimization under geological uncertainty (Q2221187) (← links)
• Managing geological uncertainty in expensive reservoir simulation optimization (Q2221189) (← links)
• Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\) (Q2222168) (← links)
• Decomposition in derivative-free optimization (Q2231319) (← links)
• A steepest descent method for set optimization problems with set-valued mappings of finite cardinality (Q2231334) (← links)
• Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization (Q2244360) (← links)