Using simplex gradients of nonsmooth functions in direct search methods

DOI10.1093/IMANUM/DRN045zbMath1156.65059OpenAlexW1990599485WikidataQ58040596 ScholiaQ58040596MaRDI QIDQ3543420

A. L. Custódio, John E. jun. Dennis, Luis Nunes Vicente

Publication date: 2 December 2008

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/102066

zbMATH Keywords

nonsmooth analysisderivative-free optimizationmesh adaptive direct searchsimplex gradientspoisednessgeneralized pattern search methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (31)

On the properties of positive spanning sets and positive bases ⋮ Derivative-free methods for mixed-integer nonsmooth constrained optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ A derivative-free approximate gradient sampling algorithm for finite minimax problems ⋮ Using inexact gradients in a multilevel optimization algorithm ⋮ Parallel distributed block coordinate descent methods based on pairwise comparison oracle ⋮ Efficient calculation of regular simplex gradients ⋮ Nonsmooth spectral gradient methods for unconstrained optimization ⋮ Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification ⋮ A deterministic algorithm to compute the cosine measure of a finite positive spanning set ⋮ Nicely structured positive bases with maximal cosine measure ⋮ Ensemble-Based Gradient Inference for Particle Methods in Optimization and Sampling ⋮ Analysis of direct searches for discontinuous functions ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION ⋮ A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions ⋮ Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions ⋮ 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 ⋮ Inexact restoration method for nonlinear optimization without derivatives ⋮ Use of quadratic models with mesh-adaptive direct search for constrained black box optimization ⋮ Derivative-free optimization methods for finite minimax problems ⋮ Incorporating minimum Frobenius norm models in direct search ⋮ Tuning BARON using derivative-free optimization algorithms ⋮ Generating set search using simplex gradients for bound-constrained black-box optimization ⋮ A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ Derivative-free optimization methods ⋮ Calculus Identities for Generalized Simplex Gradients: Rules and Applications ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization ⋮ The calculus of simplex gradients

This page was built for publication: Using simplex gradients of nonsmooth functions in direct search methods