IMFIL

swMATH4814MaRDI QIDQ16976FDOQ16976

Author name not available (Why is that?)

Described by source

• Implicit filtering

Cited In (51)

• Constrained numerical optimization methods for blind deconvolution
• Variable metric random pursuit
• Escaping local minima with local derivative-free methods: a numerical investigation
• Title not available (Why is that?)
• Solving nonlinear programming problems with noisy function values and noisy gradients
• Analysis of the BFGS Method with Errors
• Algorithms for noisy problems in gas transmission pipeline optimization
• Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
• Numerical methods for CT reconstruction with unknown geometry parameters
• A Modified Coordinate Search Method Based on Axes Rotation
• A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization
• A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization
• Generating set search using simplex gradients for bound-constrained black-box optimization
• Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization
• How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem
• Cluster Gauss-Newton method. An algorithm for finding multiple approximate minimisers of nonlinear least squares problems with applications to parameter estimation of pharmacokinetic models
• Geometry of interpolation sets in derivative free optimization
• Control of dead-time systems using derivative free local search guided population based incremental learning algorithms
• Efficient calculation of regular simplex gradients
• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• Non-intrusive termination of noisy optimization
• Using Sampling and Simplex Derivatives in Pattern Search Methods
• A deterministic algorithm to compute the cosine measure of a finite positive spanning set
• Theoretical connections between optimization algorithms based on an approximate gradient
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems
• Nonsmooth spectral gradient methods for unconstrained optimization
• On the properties of positive spanning sets and positive bases
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
• CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
• Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
• Optimization with hidden constraints and embedded Monte Carlo computations
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
• Title not available (Why is that?)
• GPU parameter tuning for tall and skinny dense linear least squares problems
• A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling
• Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition
• On the numerical performance of finite-difference-based methods for derivative-free optimization
• Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
• Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints
• Understanding the effects of polymer extrusion filter layering configurations using simulation-based optimization
• Approximating the diagonal of a Hessian: which sample set of points should be used
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems
• A comparison of evolution strategies with other direct search methods in the presence of noise
• Derivative-free optimization methods
• HIGH-ORDER RADIATION BOUNDARY CONDITIONS FOR STRATIFIED MEDIA AND CURVILINEAR COORDINATES
• The calculus of simplex gradients
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Calculus Identities for Generalized Simplex Gradients: Rules and Applications
• A practical approach to parameter estimation applied to model predicting heart rate regulation
• On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming
• Full-low evaluation methods for derivative-free optimization

This page was built for software: IMFIL