Filter-based DIRECT method for constrained global optimization
From MaRDI portal
Publication:721164
DOI10.1007/s10898-017-0596-8zbMath1402.90127OpenAlexW2775328363WikidataQ57573458 ScholiaQ57573458MaRDI QIDQ721164
Ana Maria A. C. Rocha, M. Fernanda P. Costa, Edite M. G. P. Fernandes
Publication date: 18 July 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/57942
Related Items (8)
A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization ⋮ The DIRECT algorithm: 25 years later ⋮ Preface to the special issue ``GOW'16 ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ Filter-based stochastic algorithm for global optimization
Uses Software
Cites Work
- Unnamed Item
- Stochastic filter methods for generally constrained global optimization
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- An improved filter method for nonlinear complementarity problem
- A modified DIRECT algorithm with bilevel partition
- A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues
- Global optimization by multilevel partition
- Filter-based genetic algorithm for mixed variable programming
- An approach to constrained global optimization based on exact penalty functions
- A nonmonotone filter method for nonlinear optimization
- Additive scaling and the \texttt{DIRECT} algorithm
- A derivative-free filter algorithm for nonlinear complementarity problem
- A nonmonotone filter trust region method for nonlinear constrained optimization
- A bundle-filter method for nonsmooth convex constrained optimization
- Lipschitzian optimization without the Lipschitz constant
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A filter algorithm with inexact line search
- A partition-based global optimization algorithm
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Linear scaling and the DIRECT algorithm
- A DIRECT-type approach for derivative-free constrained global optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Direct search methods for nonlinearly constrained optimization using filters and frames
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
- Algorithm 897
- Global Convergence of Filter Methods for Nonlinear Programming
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global Optimization and Constraint Satisfaction
- Introduction to global optimization.
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: Filter-based DIRECT method for constrained global optimization
