Mathematically rigorous global optimization in floating-point arithmetic
From MaRDI portal
Publication:4685569
DOI10.1080/10556788.2018.1435649zbMath1398.65093OpenAlexW2792062350MaRDI QIDQ4685569
Publication date: 9 October 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1435649
global optimizationconstrained optimizationalgorithmic differentiationrigorous error boundsverification methods
Numerical mathematical programming methods (65K05) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Algorithms with automatic result verification (65G20)
Related Items
Persistence of Periodic Orbits under State-dependent Delayed Perturbations: Computer-assisted Proofs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- A generalization of \(p\)-boxes to affine arithmetic
- Interval method for bounding level sets: Revisited and tested with global optimization problems
- On verified numerical computations in convex programming
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- The GLOBAL optimization method revisited
- Efficient interval partitioning for constrained global optimization
- Generalized descent for global optimization
- Bounding solutions of systems of equations using interval analysis
- An interval branch and bound algorithm for bound constrained optimization problems
- On proving existence of feasible points in equality constrained optimization problems
- Fast and parallel interval arithmetic
- PROFIL/BIAS - A fast interval library
- A rigorous lower bound for the optimal value of convex optimization problems
- A comparison of complete global optimization solvers
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Affine arithmetic: concepts and applications
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Circular arithmetic and the determination of polynomial zeros
- Second-order sufficient optimality conditions for local and global nonlinear programming
- Einschliessungssatz für die charakteristischen Zahlen von Matrizen
- Lectures on Modern Convex Optimization
- Verification methods: Rigorous results using floating-point arithmetic
- Improved Backward Error Bounds for LU and Cholesky Factorizations
- INTLAB implementation of an interval global optimization algorithm
- Evaluating Derivatives
- An efficient overloaded implementation of forward mode automatic differentiation in MATLAB
- A Test for Existence of Solutions to Nonlinear Systems
- Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
- Private Observation, Communication and Collusion
- Complete search in continuous global optimization and constraint satisfaction
- Source Transformation for MATLAB Automatic Differentiation
- Rigorous and portable standard functions
