Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization
From MaRDI portal
Publication:5122272
DOI10.1007/978-3-030-40616-5_5OpenAlexW3005962800MaRDI QIDQ5122272
Ana Maria A. C. Rocha, M. Fernanda P. Costa, Edite M. G. P. Fernandes
Publication date: 22 September 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/66430
Uses Software
Cites Work
- A modified DIRECT algorithm with bilevel partition
- Filter-based DIRECT method for constrained global optimization
- Additive scaling and the \texttt{DIRECT} algorithm
- Lipschitzian optimization without the Lipschitz constant
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- A DIRECT-type approach for derivative-free constrained global optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- Deterministic Global Optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Nonlinear programming without a penalty function.
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization
