Pages that link to "Item:Q3611732"
From MaRDI portal
The following pages link to Introduction to Derivative-Free Optimization (Q3611732):
Displaying 50 items.
- Derivative-free optimization methods for finite minimax problems (Q4924116) (← links)
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (Q4960952) (← links)
- An Iterative Ensemble Kalman Smoother in Presence of Additive Model Error (Q4960990) (← links)
- Stochastic Three Points Method for Unconstrained Smooth Minimization (Q4971022) (← links)
- A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
- 1 Model reduction in chemical process optimization (Q4993244) (← links)
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise (Q4997171) (← links)
- Optimization of Stochastic Blackboxes with Adaptive Precision (Q5020850) (← links)
- 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 (Q5031804) (← links)
- Derivative-Free Bayesian Inversion Using Multiscale Dynamics (Q5037770) (← links)
- Model-Based Derivative-Free Methods for Convex-Constrained Optimization (Q5043286) (← links)
- Adaptive Gradient-Free Method for Stochastic Optimization (Q5054162) (← links)
- Using first-order information in direct multisearch for multiobjective optimization (Q5058408) (← links)
- Multi-objective design optimization of antenna structures using sequential domain patching with automated patch size determination (Q5058714) (← links)
- Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method (Q5058821) (← links)
- Ensemble Gradient for Learning Turbulence Models from Indirect Observations (Q5065144) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning (Q5071109) (← links)
- A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results (Q5075237) (← links)
- Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models (Q5079553) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions (Q5081786) (← links)
- Bayesian Optimization Via Barrier Functions (Q5083356) (← links)
- Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty (Q5085157) (← links)
- Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
- Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization (Q5095497) (← links)
- Anisotropic Diffusion in Consensus-Based Optimization on the Sphere (Q5097020) (← links)
- A derivative-free algorithm for non-linear optimization with linear equality constraints (Q5110328) (← links)
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
- Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
- SOCEMO: Surrogate Optimization of Computationally Expensive Multiobjective Problems (Q5131689) (← links)
- Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis (Q5147988) (← links)
- Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework (Q5148193) (← links)
- Black-Box Optimization: Methods and Applications (Q5153493) (← links)
- The No Free Lunch Theorem: What Are its Main Implications for the Optimization Practice? (Q5153509) (← links)
- Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems (Q5155232) (← links)
- (Q5159474) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization (Q5172957) (← links)
- Trade-off studies in blackbox optimization (Q5200553) (← links)
- Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint (Q5223042) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Parameter Estimation for Macroscopic Pedestrian Dynamics Models from Microscopic Data (Q5231228) (← links)
- Distributed Subgradient-Free Stochastic Optimization Algorithm for Nonsmooth Convex Functions over Time-Varying Networks (Q5232244) (← links)
- A direct search approach to optimization for nonlinear model predictive control (Q5247894) (← links)
- Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms (Q5256808) (← links)
- An affine-scaling derivative-free trust-region method for solving nonlinear systems subject to linear inequality constraints (Q5266156) (← links)
- CONORBIT: constrained optimization by radial basis function interpolation in trust regions (Q5268937) (← links)
- A Stochastic Simplex Approximate Gradient (StoSAG) for optimization under uncertainty (Q5272539) (← links)
