scientific article; zbMATH DE number 869737
From MaRDI portal
Publication:4874513
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonlinear programming (90C30)
Recommendations
- Verification of constrained minima
- Mathematically rigorous global optimization in floating-point arithmetic
- Complete search in continuous global optimization and constraint satisfaction
- A validation and verification tool for global optimization solvers
- Constraint aggregation for rigorous global optimization
Cited in
(22)- A gentle introduction to Numerica
- On proving existence of feasible points in equality constrained optimization problems
- How to guarantee finite termination of verifying global optimization codes
- Numerical solution for bounding feasible point sets
- Credal networks
- Interval analysis: Theory and applications
- Verification of constrained minima
- Rigorous verification of feasibility
- Exclusion regions for optimization problems
- An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- Reliable optimization techniques and their application
- A validation and verification tool for global optimization solvers
- Mathematically rigorous global optimization in floating-point arithmetic
- scientific article; zbMATH DE number 815479 (Why is no real title available?)
- Some feasibility sampling procedures in interval methods for constrained global optimization
- Complete search in continuous global optimization and constraint satisfaction
- Verified reductions for optimization
- Interval branch and bound with local sampling for constrained global optimization
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems
- A fast memoryless interval-based algorithm for global optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4874513)
