Using simplex gradients of nonsmooth functions in direct search methods
From MaRDI portal
Recommendations
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- scientific article; zbMATH DE number 1301900
- scientific article; zbMATH DE number 879773
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
Cited in
(38)- Incorporating minimum Frobenius norm models in direct search
- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\)
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- Calculus identities for generalized simplex gradients: rules and applications
- Generalized pattern searches with derivative information
- Generating set search using simplex gradients for bound-constrained black-box optimization
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Efficient calculation of regular simplex gradients
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Direct search based on probabilistic descent
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Ensemble-Based Gradient Inference for Particle Methods in Optimization and Sampling
- Analysis of direct searches for discontinuous functions
- Inexact restoration method for nonlinear optimization without derivatives
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- 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
- Tuning BARON using derivative-free optimization algorithms
- Parallel distributed block coordinate descent methods based on pairwise comparison oracle
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- Derivative-free bound-constrained optimization for solving structured problems with surrogate models
- Nicely structured positive bases with maximal cosine measure
- Derivative-free optimization methods for finite minimax problems
- Using inexact gradients in a multilevel optimization algorithm
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- Perspectives on locally weighted ensemble Kalman methods
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Derivative-free optimization methods
- The calculus of simplex gradients
- Derivative-free optimization: a review of algorithms and comparison of software implementations
This page was built for publication: Using simplex gradients of nonsmooth functions in direct search methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543420)
