Pages that link to "Item:Q496103"

The following pages link to A reliable affine relaxation method for global optimization (Q496103):

Displaying 20 items.

• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
• The small octagons of maximal width (Q1953053) (← links)
• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems (Q2022241) (← links)
• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
• An interval branch and bound method for global robust optimization (Q2046260) (← links)
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
• Numerical certification of Pareto optimality for biobjective nonlinear problems (Q2154462) (← links)
• On rigorous upper bounds to a global optimum (Q2250091) (← links)
• On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
• Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms (Q2274873) (← links)
• Maximal perimeter, diameter and area of equilateral unit-width convex polygons (Q2392128) (← links)
• A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
• A generic interval branch and bound algorithm for parameter estimation (Q2416576) (← links)
• Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems (Q2423791) (← links)
• Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (Q5746707) (← links)
• Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)