New subinterval selection criteria for interval global optimization

DOI10.1023/A:1011228208051MaRDI QIDQ5940045zbMATH OpenOpenAlexFDO

Authors Tibor Csendes

Publication date 24 February 2004

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

Full work available at URL https://doi.org/10.1023/a:1011228208051

zbMATH Keywords

convergence propertiesinterval methodsinterval selection

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Nonconvex programming, global optimization (90C26)

Recommendations

• Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
• New interval methods for constrained global optimization
• Generalized subinterval selection criteria for interval global optimization
• Experiments with a new selection criterion in a fast interval optimization algorithm
• A heuristic rejection criterion in interval global optimization algorithms

Cited in

(17)

• Heuristic rejection in interval global optimization
• Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
• Generalized subinterval selection criteria for interval global optimization
• New interval methods for constrained global optimization
• Optimal centers in branch-and-prune algorithms for univariate global optimization
• A new pruning test for finding all global minimizers of nonsmooth functions
• A new inclusion function for optimization: kite -- the one-dimensional case
• Optimal circle covering problems and their applications
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Probabilistic subproblem selection in branch-and-bound algorithms
• Experiments with a new selection criterion in a fast interval optimization algorithm
• Theoretical justification of a heuristic subbox selection criterion for interval global optimization
• A heuristic rejection criterion in interval global optimization algorithms
• Node selection strategies in interval branch and bound algorithms
• Two acceleration mechanisms in verified global optimization
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems

Describes a project that uses

Uses Software

• INTOPT_90

This page was built for publication: New subinterval selection criteria for interval global optimization

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