Extensions of affine arithmetic: application to unconstrained global optimization

MaRDI QIDQ5421933zbMATH OpenFDO

Authors Frédéric Messine

Publication date 25 October 2007

Full work available at URL http://www.jucs.org/jucs_8_11/extentions_of_affine_arithmetic

zbMATH Keywords

global optimizationbranch and bound algorithminclusion functionsAffine arithmetic

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Interval and finite arithmetic (65G30)

Recommendations

• A general reliable quadratic form: An extension of affine arithmetic
• Algorithm for min-range multiplication of affine forms
• scientific article; zbMATH DE number 1543292
• A reliable affine relaxation method for global optimization
• scientific article; zbMATH DE number 852342

Cited in

(23)

• Hybridizing two linear relaxation techniques in interval-based solvers
• Certification of real inequalities: templates and sums of squares
• An interval inverse method based on high dimensional model representation and affine arithmetic
• A revised monotonicity-based method for computing tight image enclosures of functions
• Improved convex and concave relaxations of composite bilinear forms
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Deterministic global optimization using interval constraint propagation techniques
• A reliable affine relaxation method for global optimization
• The small octagons of maximal width
• A comparison of methods for solving parametric interval linear systems with general dependencies
• Empirical convergence speed of inclusion functions for facility location problems
• Modified affine arithmetic is more accurate than centered interval arithmetic or affine arithmetic
• raSAT: an SMT solver for polynomial constraints
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
• Adaptive constructive interval disjunction: algorithms and experiments
• Algorithm for min-range multiplication of affine forms
• Numerical certification of Pareto optimality for biobjective nonlinear problems
• raSAT: An SMT Solver for Polynomial Constraints
• Enhancing numerical constraint propagation using multiple inclusion representations
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context
• Robustness verification of support vector machines
• A general reliable quadratic form: An extension of affine arithmetic

This page was built for publication: Extensions of affine arithmetic: application to unconstrained global optimization

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