113 7.2 Details on the instances, p.114 ,
, Convex reformulation with other quadratization schemes
Results related to Rosenberg's reformulation, p.123 ,
Tightness of semi-definite relaxations for box-constrained polynomial programs, p.136 ,
, We present the computational results obtained by the different methods presented in this thesis. previous methods. Moreover, we also provide detailed theoretical comparisons between our methods and those of the literature
,
Scip : solving constraint integer programs, Mathematical Programming Computation, issue.1, pp.1-41, 2009. ,
A global optimization method, ?bb, for general twice-differentiable constrained nlps-i. theoretical advances, Computers and Chemical Engineering, vol.22, issue.9, pp.1137-1158, 1998. ,
Dsos and sdsos optimization: Lp and socp-based alternatives to sum of squares optimization, 48th Annual Conference on Information Sciences and Systems (CISS), pp.1-5, 2014. ,
Handbook of semidefinite, conic and polynomial optimization: Theory, algorithms, software and applications, International Series in Operational Research and Management Science, vol.166, 2012. ,
Quadratic reformulations of nonlinear binary optimization problems, Mathematical Programming, vol.162, pp.115-144, 2017. ,
, On characterization of maximal independent sets via quadratic optimization, vol.19, 2011.
Enveloppe convexe de la linéarisation d'une fonction pseudo-booléenne, 2018. ,
Branching and bounds tightening techniques for non-convex minlp, Optimization Methods and Software, issue.24, pp.597-634, 2009. ,
Low autocorrelation binary sequences: statistical mechanics and configuration space analysis, J. Physique, vol.141, issue.48, pp.559-567, 1987. ,
Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem, Mathematical Programming, vol.109, issue.1, pp.55-68, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-01124790
Exact quadratic convex reformulations of mixedinteger quadratically constrained problems, Mathematical Programming, vol.158, issue.1, pp.235-266, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01500210
Using a Conic Bundle method to accelerate both phases of a Quadratic Convex Reformulation, INFORMS Journal on Computing, vol.29, issue.2, pp.318-331, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01811329
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Discrete Applied Mathematics, vol.157, issue.6, pp.1185-1197, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01125253
, Optimization Methods and Software, vol.11, issue.1, pp.613-623, 1999.
Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables, ISAIM, International Symposium on Artificial Intelligence and Mathematics, 2018. ,
A hypergraph-based reduction for higherorder binary Markov random fields, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.37, issue.7, pp.1387-1395, 2015. ,
On quadratization of pseudo-Boolean functions, ISAIM, Fort Lauderdale, 2012. ISAIM, International Symposium on Artificial Intelligence and Mathematics. Open Source ,
Pseudo-boolean optimization, Discrete Applied Mathematics, vol.123, issue.1, pp.155-225, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-01150533
Network flows and minimization of quadratic pseudoboolean functions, 1991. ,
Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, Journal of Global Optimization, pp.1-28, 2016. ,
Efficient reduction of polynomial zero-one optimization to the quadratic case, SIAM Journal on Optimization, vol.18, issue.4, pp.1398-1413, 2007. ,
On convex relaxations of quadrilinear terms, Journal of Global Optimization, vol.47, issue.4, pp.661-685, 2010. ,
The indefinite zero-one quadratic problem, Discrete Applied Mathematics, pp.23-44, 1984. ,
A class of valid inequalities for multilinear 0-1 optimization problems. Discrete Optimization, pp.28-47, 2017. ,
On linear programming relaxations for solving polynomial programming problems, Computers and Operations Research, vol.99, pp.67-77, 2018. ,
Rlt-pos: Reformulation-linearization technique-based optimization software for solving polynomial programming problems, Mathematical Programming Computation, vol.8, issue.3, pp.337-375, 2016. ,
The multilinear polytope for acyclic hypergraphs, SIAM Journal on Optimization, vol.28, issue.2, pp.1049-1076, 2018. ,
L'algèbre de Boole et ses Applications en Recherche Opérationnelle. Cahiers du Centre d, Etudes de Recherche Opérationnelle, vol.4, pp.5-36, 1959. ,
AMPL: A Modeling Language for Mathematical Programming, 1993. ,
Energy minimization via graph cuts: settling what is possible, IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), vol.2, pp.939-946, 2005. ,
Computers and Intractability: A guide to the theory of NP-Completness, 1979. ,
Uber die abgrenzung der eigenwerte einer matrix, Sciences de l'URSS, vol.6, pp.749-754, 1931. ,
A dynamic inequality generation scheme for polynomial programming, Mathematical Programming, vol.156, issue.1, pp.21-57, 2016. ,
Further reduction of zero-one polynomial programs to zero-one linear programming, 1973. ,
Converting the 0-1 polynomial programming problem to a 0-1 linear program, 1974. ,
A tutorial on formulating QUBO models, 2018. ,
Tight convex underestimators for C 2 -continuous problems: II. multivariate functions, Journal of Global Optimization, vol.42, issue.1, pp.69-89, 2008. ,
Boolean Methods in Operations Research and Related Areas, 1968. ,
Some remarks on quadratic programming with 0-1 variables. Revue Française d'Informatique et de Recherche Opérationnelle, vol.4, pp.67-79, 1970. ,
, Conic Bundle, 2011.
Gloptipoly: Global optimization over polynomials with matlab and sedumi, ACM Transactions on Mathematical Software, vol.29, issue.2, pp.165-194, 2003. ,
, IBM ILOG CPLEX 12.7 Reference Manual, 2017.
Transformation of general binary MRF minimization to the first-order case, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.6, pp.1234-1249, 2011. ,
BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints, 2018. ,
Reducibility among combinatorial problems, pp.85-103, 1972. ,
What energy functions can be minimized via graph cuts?, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, pp.147-159, 2004. ,
Computer-aided layout design, pp.75-94, 1978. ,
Alternative SDP and SOCP Approximations for Polynomial Optimization, 2015. ,
Résolution de programmes quadratiques en nombres entiers, Conservatoire National des Arts et Métiers, 2009. ,
Global optimization with polynomials and the problem of moments, SIAM Journal on Optimization, vol.11, issue.3, pp.796-817, 2001. ,
An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM Journal on Optimization, vol.12, issue.3, pp.756-769, 2002. ,
An Introduction to Polynomial and Semi-Algebraic Optimization, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-02095856
Convex underestimators of polynomials, Journal of Global Optimization, pp.1-25, 2013. ,
Quadratic binary programming with applications to capital budgeting problems, vol.18, pp.454-461, 1970. ,
A comparison of the sherali-adams, lovász-schrijver, and lasserre relaxations for 0-1 programming, Mathematics of Operations Research, vol.28, issue.3, pp.470-496, 2003. ,
Semidefinite relaxations and lagrangian duality with application to combinatorial optimization, INRIA Rhones-Alpes, 1999. ,
URL : https://hal.archives-ouvertes.fr/inria-00072958
Some transformation techniques with applications in global optimization, Journal of Global Optimization, vol.43, issue.2, pp.391-405, 2009. ,
Global optimization in generalized geometric programming, Computers & Chemical Engineering, vol.21, issue.4, pp.351-369, 1997. ,
An implicit enumeration algorithm for quadratic integer programming, Management Science, 1980. ,
Computability of global solutions to factorable non-convex programs: Part i -convex underestimating problems, Mathematical Programming, vol.10, issue.1, pp.147-175, 1976. ,
Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes, Journal of Global Optimization, vol.29, issue.2, pp.125-155, 2004. ,
Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: Spline ?bb underestimators, Journal of Global Optimization, vol.32, issue.2, pp.221-258, 2005. ,
Library of mixed integer non linear programs, 2012. ,
Antigone: algorithms for continuous/integer global optimization of nonlinear equations, Journal of Global Optimization, vol.59, issue.2-3, pp.503-526, 2014. ,
Some np-complete problems in quadratic and nonlinear programming, Mathematical Programming, vol.39, pp.117-129, 1987. ,
The boolean quadric polytope: some characteristics, facets and relatives. Mathematical programming, vol.45, pp.139-172, 1989. ,
Boolean polynomials and set functions, Mathematical and computer modelling, vol.17, issue.9, pp.3-6, 1989. ,
The maximum clique problem, Journal of Global Optimization, vol.4, issue.3, pp.301-328, 1994. ,
Cluster analysis and mathematical programming, Journal of the American Statistical Association, vol.66, issue.335, pp.622-626, 1971. ,
A selection problem of shared fixed costs and network flows, Management Science, vol.17, issue.3, pp.200-207, 1970. ,
Linear and quadratic reformulations of nonlinear optimization problems in binary variables, 2018. ,
Reduction of bivalent maximization to the quadratic case, vol.17, pp.71-74, 1975. ,
Baron 9.0.4: Global optimization of mixed-integer nonlinear programs. User's Manual, 2010. ,
A hierarchy of relaxation between the continuous and convex hull representations for zero-one programming problems, SIAM Journal Discrete Mathematics, vol.3, pp.411-430, 1990. ,
A global optimization algorithm for polynomial programming using a reformulation-linearization technique, Journal of Global Optimization, vol.2, pp.101-112, 1992. ,
, The cut polytope and the boolean quadric polytope. Discrete Mathematics, vol.79, pp.71-75, 1990.
Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. OPTMS, pp.625-653, 1999. ,
Convex extensions and convex envelopes of l.s.c. functions. math. program, Mathematical Programming, vol.93, pp.247-263, 2002. ,
Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Optimization Methods and Software, pp.1-31, 2017. ,
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Mathematical Programming, vol.106, issue.1, pp.25-57, 2006. ,
Letter to the editor-reduction of integer polynomial programming problems to zero-one linear programming problems, Operations Research, vol.15, issue.6, pp.1171-1174, 1967. ,
Media Selection by Decision Programming, pp.132-133, 1976. ,