Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm

DOI10.1007/S10898-006-9072-6MaRDI QIDQ2460123zbMATH OpenOpenAlexFDO

Authors Boglárka G.-Tóth, L. G. Casado

Publication date 14 November 2007

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-006-9072-6

zbMATH Keywords

interval arithmeticbranch-and-bound methodpruning test

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A branch-and-prune method for global optimization
• scientific article; zbMATH DE number 1984130
• Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
• A multidimensional branch-and-prune method for interval global optimization
• Optimal centers in branch-and-prune algorithms for univariate global optimization

Cites work

• scientific article; zbMATH DE number 3917583 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• scientific article; zbMATH DE number 2068067 (Why is no real title available?)
• scientific article; zbMATH DE number 761488 (Why is no real title available?)
• scientific article; zbMATH DE number 802433 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• A new multisection technique in interval methods for global optimization
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• Global optimization
• Numerical Software with Result Verification
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Optimal centered forms
• PROFIL/BIAS - A fast interval library
• Rigorous global search: continuous problems
• Subdivision Direction Selection in Interval Methods for Global Optimization

Cited in

(6)

• Optimal centers in branch-and-prune algorithms for univariate global optimization
• A branch-and-prune method for global optimization
• scientific article; zbMATH DE number 1984130 (Why is no real title available?)
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
• On interval branch-and-bound for additively separable functions with common variables
• Time-optimal velocity planning by a bound-tightening technique

Describes a project that uses

Uses Software

• INTOPT_90
• AMIGO
• PROFIL/BIAS
• C-XSC 2.0
• C-XSC

This page was built for publication: Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm

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