New interval methods for constrained global optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 818540
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- New interval analysis support functions using gradient information in a global minimization algorithm
- Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
- What can interval analysis do for global optimization?
Cites work
- A continuous location model for siting a non-noxious undesirable facility within a geographical region
- A heuristic rejection criterion in interval global optimization algorithms
- A new multisection technique in interval methods for global optimization
- A posteriori direction selection rules for interval optimization methods
- An interval method to validate optimal solutions of the ``packing circles in a unit square problems
- Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method
- Dynamic facility location: The progressive p-median problem
- Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set
- Experiments using interval analysis for solving a circuit design problem
- Experiments with a new selection criterion in a fast interval optimization algorithm
- Global optimization using interval analysis - the multi-dimensional case
- Handbook of global optimization
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1067639 (Why is no real title available?)
- scientific article; zbMATH DE number 761488 (Why is no real title available?)
- scientific article; zbMATH DE number 903760 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 226866 (Why is no real title available?)
- scientific article; zbMATH DE number 970348 (Why is no real title available?)
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- New results on verified global optimization
- New subinterval selection criteria for interval global optimization
- On proving existence of feasible points in equality constrained optimization problems
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- PROFIL/BIAS - A fast interval library
- Rigorous global search: continuous problems
- Subdivision Direction Selection in Interval Methods for Global Optimization
- The convergence speed of interval methods for global optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Using interval analysis for solving planar single-facility location problems: New discarding tests
- What can interval analysis do for global optimization?
Cited in
(38)- Interval oriented multi-section techniques for global optimization
- Solving constrained optimization problems using a novel genetic algorithm
- A priority measure in interval methods for constrained global optimization
- New interval analysis support functions using gradient information in a global minimization algorithm
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- Using interval analysis for solving planar single-facility location problems: New discarding tests
- On interval branch-and-bound for additively separable functions with common variables
- The 1-center problem in the plane with independent random weights
- Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
- An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- scientific article; zbMATH DE number 2058467 (Why is no real title available?)
- scientific article; zbMATH DE number 1786147 (Why is no real title available?)
- Bound constrained interval global optimization in the COCONUT environment
- scientific article; zbMATH DE number 818540 (Why is no real title available?)
- Upper bounding in inner regions for global optimization under inequality constraints
- A reliable affine relaxation method for global optimization
- Some feasibility sampling procedures in interval methods for constrained global optimization
- scientific article; zbMATH DE number 6183018 (Why is no real title available?)
- scientific article; zbMATH DE number 970348 (Why is no real title available?)
- Deterministic global optimization using interval constraint propagation techniques
- New subinterval selection criteria for interval global optimization
- Node selection strategies in interval branch and bound algorithms
- (Global) optimization: historical notes and recent developments
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- New enclosure algorithms for the verified solutions of nonlinear Volterra integral equations
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Efficient use of optimality conditions in interval branch and bound methods
- Node selection through upper bounding local search methods in branch \& bound solvers for NCOPs
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Interval branch and bound with local sampling for constrained global optimization
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Adaptive constructive interval disjunction: algorithms and experiments
- Efficient interval partitioning for constrained global optimization
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
This page was built for publication: New interval methods for constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490338)
