Upper bounding in inner regions for global optimization under inequality constraints

DOI10.1007/s10898-014-0145-7zbMath1312.90057OpenAlexW2062609317MaRDI QIDQ486384

Bertrand Neveu, Gilles Chabert, Gilles Trombettoni, Ignacio J. Araya

Publication date: 15 January 2015

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

Full work available at URL: http://hdl.handle.net/10533/128153

zbMATH Keywords

intervalsglobal optimizationbranch and boundinner regionsinterval Taylorupper bounding

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (14)

Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Constrained global optimization for wine blending ⋮ A certified branch \& bound approach for reliability-based optimization problems ⋮ A generic interval branch and bound algorithm for parameter estimation ⋮ A global constraint for over-approximation of real-time streams ⋮ Interval methods for model qualification: methodology and advanced application ⋮ Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation ⋮ Construction of parametric barrier functions for dynamical systems using interval analysis ⋮ \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms ⋮ \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Node selection strategies in interval branch and bound algorithms

Uses Software

• Couenne
• INTOPT_90
• COCONUT
• IbexOpt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reliable affine relaxation method for global optimization
• Contractor programming
• Rigorous global search: continuous problems
• Computational complexity and feasibility of data processing and interval computations
• A polyhedral branch-and-cut approach to global optimization
• Constructive Interval Disjunction
• Introduction to Interval Analysis
• Interval Methods for Systems of Equations
• Algebraic links and skein relations of the Links-Gould invariant
• On the Solution Set of a Linear System with Inaccurate Coefficients
• Efficient and Safe Global Constraints for Handling Numerical Constraint Systems

This page was built for publication: Upper bounding in inner regions for global optimization under inequality constraints