A class of problems that can be solved using interval algorithms

DOI10.1007/S00607-011-0173-9MaRDI QIDQ411419zbMATH OpenOpenAlexFDO

Authors Bartłomiej Jacek Kubica

Publication date 4 April 2012

Published in Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s00607-011-0173-9

zbMATH Keywords

data structuresinterval algorithmsinterval branch-and-bound methodsmultithreaded programmingpredicate logicshared-memory parallelization

Mathematics Subject Classification ID

General methods in interval analysis (65G40) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• A conservative scheme for parallel interval narrowing
• scientific article; zbMATH DE number 802433
• scientific article; zbMATH DE number 903770
• scientific article; zbMATH DE number 1292983

Cites work

• A new technique in systems analysis under interval uncertainty and ambiguity
• A surprising approach in interval global optimization
• Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic
• Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
• From computing sets of optima, Pareto sets, and sets of Nash equilibria to general decision-related set computations
• scientific article; zbMATH DE number 1595639 (Why is no real title available?)
• scientific article; zbMATH DE number 5775425 (Why is no real title available?)
• scientific article; zbMATH DE number 2035082 (Why is no real title available?)
• scientific article; zbMATH DE number 6876104 (Why is no real title available?)
• scientific article; zbMATH DE number 2090047 (Why is no real title available?)
• scientific article; zbMATH DE number 804633 (Why is no real title available?)
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• On maximal inner estimation of the solution sets of linear systems with interval parameters
• Rigorous global search: continuous problems
• The Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients
• Verified methods for computing Pareto sets: general algorithmic analysis

Cited in

(5)

• A conservative scheme for parallel interval narrowing
• scientific article; zbMATH DE number 903770 (Why is no real title available?)
• The Fritz-John Condition System in Interval Branch and Bound method
• A novel set-membership control strategy for discrete-time linear time-varying systems
• Distributed networked set-membership filtering with ellipsoidal state estimations

Describes a project that uses

Uses Software

• Intel TBB
• INTOPT_90

This page was built for publication: A class of problems that can be solved using interval algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411419)