Pages that link to "Item:Q3611732"

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

Displaying 50 items.

• Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers (Q2425163) (← links)
• A trust-region-based derivative free algorithm for mixed integer programming (Q2515071) (← links)
• Solving air traffic conflict problems via local continuous optimization (Q2629693) (← links)
• Surrogate-based distributed optimisation for expensive black-box functions (Q2663899) (← links)
• Convergence of the Nelder-Mead method (Q2672718) (← links)
• A simulation-based optimization approach for the calibration of a discrete event simulation model of an emergency department (Q2678617) (← links)
• Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
• Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\) (Q2687735) (← links)
• Practical initialization of the Nelder-Mead method for computationally expensive optimization problems (Q2688914) (← links)
• Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
• Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points (Q2696568) (← links)
• Parallel strategies for direct multisearch (Q2699998) (← links)
• A derivative-free algorithm for refining numerical microaggregation solutions (Q2794680) (← links)
• A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
• Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints (Q2815544) (← links)
• Trust-region methods without using derivatives: worst case complexity and the nonsmooth case (Q2826817) (← links)
• Non-intrusive termination of noisy optimization (Q2867421) (← links)
• On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization (Q2867433) (← links)
• Bilevel derivative-free optimization and its application to robust optimization (Q2885495) (← links)
• Optimizing Network Topology for Cascade Resilience (Q2917208) (← links)
• Multifidelity approaches for optimization under uncertainty (Q2952604) (← links)
• Augmented Lagrangian Pattern Search Based Multi-Agent Model Predictive Control of Rhine-Meuse Delta (Q2960148) (← links)
• Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming (Q2970395) (← links)
• The Gauss-Newton Methods via Conjugate Gradient Path without Line Search Technique for Solving Nonlinear Systems (Q2987788) (← links)
• Surrogate-Based Methods (Q3020436) (← links)
• An active-set trust-region method for derivative-free nonlinear bound-constrained optimization (Q3096885) (← links)
• STUDYING THE BASIN OF CONVERGENCE OF METHODS FOR COMPUTING PERIODIC ORBITS (Q3165821) (← links)
• A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization (Q3174787) (← links)
• Experimental Design for Nonparametric Correction of Misspecified Dynamical Models (Q3176250) (← links)
• A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization (Q3179268) (← links)
• Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation (Q3179313) (← links)
• A Modified Coordinate Search Method Based on Axes Rotation (Q3300045) (← links)
• A derivative-free comirror algorithm for convex optimization (Q3458813) (← links)
• Improving Direct Search algorithms by multilevel optimization techniques (Q3458830) (← links)
• A trust-region derivative-free algorithm for constrained optimization (Q3458835) (← links)
• Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
• ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization (Q4561224) (← links)
• Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization (Q4580293) (← links)
• On Sampling Rates in Simulation-Based Recursions (Q4600839) (← links)
• On High-order Model Regularization for Constrained Optimization (Q4602340) (← links)
• Penalty-free method for nonsmooth constrained optimization via radial basis functions (Q4633326) (← links)
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods (Q4634094) (← links)
• A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization (Q4634096) (← links)
• The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables (Q4634101) (← links)
• Adaptive Numerical Designs for the Calibration of Computer Codes (Q4636370) (← links)
• Parallel Local Approximation MCMC for Expensive Models (Q4636376) (← links)
• A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling (Q4641668) (← links)
• Global non-smooth optimization in robust multivariate regression (Q4924107) (← links)
• Use of quadratic models with mesh-adaptive direct search for constrained black box optimization (Q4924108) (← links)
• On the computation of relaxed pessimistic solutions to MPECs (Q4924110) (← links)