Pages that link to "Item:Q3543420"

The following pages link to Using simplex gradients of nonsmooth functions in direct search methods (Q3543420):

Displaying 31 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
• Using inexact gradients in a multilevel optimization algorithm (Q360389) (← links)
• Analysis of direct searches for discontinuous functions (Q431012) (← links)
• Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
• Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
• A derivative-free nonmonotone line-search technique for unconstrained optimization (Q935796) (← links)
• Incorporating minimum Frobenius norm models in direct search (Q975361) (← links)
• Parallel distributed block coordinate descent methods based on pairwise comparison oracle (Q1675626) (← links)
• Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
• Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
• Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← 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)
• Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\) (Q2222168) (← links)
• Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
• The calculus of simplex gradients (Q2355312) (← links)
• On the properties of positive spanning sets and positive bases (Q2357977) (← links)
• Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
• Efficient calculation of regular simplex gradients (Q2419521) (← links)
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations (Q2515062) (← links)
• Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
• A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION (Q4608945) (← links)
• Use of quadratic models with mesh-adaptive direct search for constrained black box optimization (Q4924108) (← links)
• Derivative-free optimization methods for finite minimax problems (Q4924116) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions (Q5379464) (← links)
• Calculus Identities for Generalized Simplex Gradients: Rules and Applications (Q5853722) (← links)
• Nicely structured positive bases with maximal cosine measure (Q6164951) (← links)
• Ensemble-Based Gradient Inference for Particle Methods in Optimization and Sampling (Q6177924) (← links)