Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
From MaRDI portal
Publication:1935888
DOI10.1007/s11750-011-0193-9zbMath1267.90110OpenAlexW2121511313WikidataQ58040555 ScholiaQ58040555MaRDI QIDQ1935888
Hoai An Le Thi, Luis Nunes Vicente, A. Ismael F. Vaz
Publication date: 20 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0193-9
DCAglobal optimizationd.c. programmingradial basis functionsderivative-free optimizationdirect-search methodssearch step
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, DC Programming and DCA for General DC Programs, Quantifying uncertainty with ensembles of surrogates for blackbox optimization, Unnamed Item, Optimization of black-box problems using Smolyak grids and polynomial approximations, \texttt{GLISp-r}: a preference-based optimization algorithm with convergence guarantees, Order-based error for managing ensembles of surrogates in mesh adaptive direct search, DC programming and DCA: thirty years of developments, An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization, CONORBIT: constrained optimization by radial basis function interpolation in trust regions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Constrained global optimization of expensive black box functions using radial basis functions
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Improved strategies for radial basis function methods for global optimization
- A deterministic global optimization algorithm
- Parallel radial basis function methods for the global optimization of expensive functions
- Genetic algorithms and very fast simulated reannealing: A comparison
- Lipschitzian optimization without the Lipschitz constant
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A note on the Griewank test function
- On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Global optimization of costly nonconvex functions using radial basis functions
- A particle swarm pattern search method for bound constrained global optimization
- A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
- Global Convergence of Radial Basis Function Trust Region Derivative-Free Algorithms
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
- ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Comparison of public-domain software for black box global optimization∗
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
- Evolutionary computation techniques for nonlinear programming problems
- Benchmarking Derivative-Free Optimization Algorithms
- A radial basis function method for global optimization
- Benchmarking optimization software with performance profiles.
- Fast global optimization of difficult Lennard-Jones clusters
