A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
From MaRDI portal
Publication:6173797
DOI10.1007/s11081-022-09729-0zbMath1530.90118OpenAlexW4310211179MaRDI QIDQ6173797
Sebastian Skibinski, Michael Eder, Michael Ulbrich
Publication date: 13 July 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-022-09729-0
deterministic global optimizationinterval arithmeticGaussian kernelB-spline curvesautomated drivinghigh definition map data
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Convergence analysis of Taylor models and McCormick-Taylor models
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- New methods for calculating \(\alpha\)BB-type underestimators
- DIRECT algorithm: A new definition of potentially optimal hyperrectangles
- The GLOBAL optimization method revisited
- An improved interval Newton operator
- Global optimization using interval analysis - the multi-dimensional case
- Global optimization by multilevel coordinate search
- Global minimum potential energy conformations of small molecules
- Lipschitzian optimization without the Lipschitz constant
- Rigorous global search: continuous problems
- A convex envelope formula for multilinear functions
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- A simplicial homology algorithm for Lipschitz optimisation
- Rigorous convex underestimators for general twice-differentiable problems
- A branch-and-reduce approach to global optimization
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Global optimization of nonconvex problems with multilinear intermediates
- Impulse functions over curves and surfaces and their applications to diffraction
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Global Optimization with Polynomials and the Problem of Moments
- Interval arithmetic
- INTLAB implementation of an interval global optimization algorithm
- McCormick-Based Relaxations of Algorithms
- On Nonconvex Quadratic Programming with Box Constraints
- Introduction to Interval Analysis
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
- Deterministic Global Optimization
- Measure and Integral
- Complete search in continuous global optimization and constraint satisfaction
- Numerical Software with Result Verification
- Branch-and-Bound Methods: General Formulation and Properties
- A Sequential Method Seeking the Global Maximum of a Function
- Sequential Minimax Search for a Maximum
- Analysis of bounds for multilinear functions
- A locally-biased form of the DIRECT algorithm.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
