A modified DIviding RECTangles algorithm for a problem in astrophysics
From MaRDI portal
Publication:650229
Recommendations
- An approximation algorithm for dissecting a rectangle into rectangles with specified areas
- Algorithms and Computation
- Algorithmic Representation of Astrophysical Structures
- On partitioning rectilinear polygons into star-shaped polygons
- Divide-and-conquer for Voronoi diagrams revisited
- Divide-and-conquer for Voronoi diagrams revisited
- Parallel algorithms for astrophysics problems
- Approximation algorithms for partitioning a rectangle with interior points
- A divide-and-conquer algorithm for grid generation
- Finding Rectangle Intersections by Divide-and-Conquer
Cites work
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A comparison of global optimization methods for the design of a high-speed civil transport
- A genetic algorithm for a global optimization problem arising in the detection of gravitational waves
- A locally-biased form of the DIRECT algorithm.
- A partition-based global optimization algorithm
- A template bank to search for gravitational waves from inspiralling compact binaries: I. Physical models
- Algorithms for noisy problems in gas transmission pipeline optimization
- Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
- Dynamic data structures for a direct search algorithm
- Gravitational radiation
- Gravitational waveforms from inspiralling compact binaries to second-post-Newtonian order
- Introduction to global optimization.
- Lipschitzian optimization without the Lipschitz constant
- Template-based searches for gravitational waves: efficient lattice covering of flat parameter spaces
- Using DIRECT to solve an aircraft routing problem
Cited in
(16)- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Globally-biased disimpl algorithm for expensive global optimization
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm
- Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- A genetic algorithm for a global optimization problem arising in the detection of gravitational waves
- A deterministic global optimization using smooth diagonal auxiliary functions
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Simplicial Lipschitz optimization without the Lipschitz constant
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
This page was built for publication: A modified DIviding RECTangles algorithm for a problem in astrophysics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650229)
