Deterministic global optimization using interval constraint propagation techniques

DOI10.1051/ro:2004026zbMath1114.90156OpenAlexW2017151271MaRDI QIDQ5693008

Frédéric Messine

Publication date: 28 September 2005

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2004__38_4_277_0

zbMATH Keywords

global optimizationbranch-and-boundpruningInterval analysis

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Numerical optimization and variational techniques (65K10) General methods in interval analysis (65G40) Methods of successive quadratic programming type (90C55)

Related Items

Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, On handling indicator constraints in mixed integer programming, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Numerical certification of Pareto optimality for biobjective nonlinear problems, The small octagon with longest perimeter, Bound reduction using pairs of linear inequalities, Maximal perimeter, diameter and area of equilateral unit-width convex polygons, The supporting hyperplane optimization toolkit for convex MINLP, Range-only SLAM with indistinguishable landmarks; a constraint programming approach, Study of multiscale global optimization based on parameter space partition, (Global) optimization: historical notes and recent developments, Domain reduction techniques for global NLP and MINLP optimization, The small octagons of maximal width, A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms, Extremal problems for convex polygons, A reliable affine relaxation method for global optimization, Mathematically Rigorous Global Optimization and Fuzzy Optimization, Isoperimetric polygons of maximum width, Optimal design of electrical machines: mathematical programming formulations

Uses Software

• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigorous global search: continuous problems
• On the combination of interval constraint solvers
• Dynamic optimization of interval narrowing algorithms
• A general analytical model of electrical permanent magnet machine dedicated to optimal design
• Interval constraint propagation with application to bounded-error estimation
• Progress in the solving of a circuit design problem