Exploiting Problem Structure in Derivative Free Optimization (Q5066599)

!

WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

Exploiting Problem Structure in Derivative Free Optimization

scientific article; zbMATH DE number 7500131

Language	Label	Description	Also known as
default for all languages	No label defined
English	Exploiting Problem Structure in Derivative Free Optimization	scientific article; zbMATH DE number 7500131

Statements

instance of

scholarly article

0 references

title

Exploiting Problem Structure in Derivative Free Optimization (English)

0 references

0 references

0 references

ACM Transactions on Mathematical Software

0 references

publication date

29 March 2022

0 references

full work available at URL

https://arxiv.org/abs/2001.04801

0 references

zbMATH Keywords

derivative-free optimization

0 references

direct-search methods

0 references

structured problems

0 references

interpolation models

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Mesh adaptive direct search algorithms for mixed variable optimization

0 references

Pattern search algorithms for mixed variable programming

0 references

Derivative-free and blackbox optimization

0 references

The mesh adaptive direct search algorithm for granular and discrete variables

0 references

Q5806242

0 references

Improving the flexibility and robustness of model-based derivative-free optimization solvers

0 references

Trust-region and other regularisations of linear least-squares problems

0 references

A derivative-free Gauss-Newton method

0 references

Exploiting band structure in unconstrained optimization without derivatives

0 references

Optimizing partially separable functions without derivatives

0 references

Trust Region Methods

0 references

Q4421356

0 references

Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation

0 references

Geometry of interpolation sets in derivative free optimization

0 references

Introduction to Derivative-Free Optimization

0 references

Q4524222

0 references

Frame based methods for unconstrained optimization

0 references

On the convergence of grid-based methods for unconstrained optimization

0 references

Positive bases in numerical optimization

0 references

Incorporating minimum Frobenius norm models in direct search

0 references

Direct Search Methods on Parallel Machines

0 references

On the Local Convergence of Pattern Search

0 references

Benchmarking optimization software with performance profiles.

0 references

Optimality Measures for Performance Profiles

0 references

CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization

0 references

Direct search based on probabilistic descent

0 references

An active-set trust-region method for derivative-free nonlinear bound-constrained optimization

0 references

A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations

0 references

`` Direct Search'' Solution of Numerical and Statistical Problems

0 references

Convergence of the restricted Nelder-Mead algorithm in two dimensions

0 references

Derivative-free optimization methods

0 references

Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm

0 references

Pattern Search Methods for Linearly Constrained Minimization

0 references

An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables

0 references

On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization

0 references

Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications

0 references

Computing a Trust Region Step

0 references

Benchmarking Derivative-Free Optimization Algorithms

0 references

A Simplex Method for Function Minimization

0 references

BFO, a trainable derivative-free brute force optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables

0 references

A note on using performance and data profiles for training algorithms

0 references

Q4308910

0 references

Q4215359

0 references

Exploiting problem structure in pattern search methods for unconstrained optimization

0 references

Parallel coordinate descent methods for big data optimization

0 references

A derivative-free trust-funnel method for equality-constrained nonlinear optimization

0 references

Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints

0 references

Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization

0 references

The Conjugate Gradient Method and Trust Regions in Large Scale Optimization

0 references

Q3914337

0 references

On the Convergence of the Multidirectional Search Algorithm

0 references

On the Convergence of Pattern Search Algorithms

0 references

Function Minimization by Interpolation in a Data Table

0 references

Coordinate descent algorithms

0 references

Identifiers

DOI

10.1145/3474054

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5066599