Algorithms for discrete nonlinear optimization in FICO Xpress

The FICO Xpress-Optimizer is a commercial optimization solver for linear programming (LP), mixed integer linear programming (MIP), convex quadratic programming (QP), convex quadratically constrained quadratic programming (QCQP), second-order cone programming (SOCP) and their mixed-integer counterparts. Xpress also includes a general purpose non-linear solver, Xpress-NonLinear, which features a successive linear programming algorithm (SLP, first-order method), interior point methods and Artelys Knitro (second-order methods). This work explores algorithms for mixed-integer nonlinear programming problems (MINLPs), which are NP-hard in general, then it presents applications in signal processing and capitalizes advances in solving these problems with Xpress and its comprehensive suite of high-performance nonlinear solvers. Computational results show that signal processing nonlinear problems can be solved quickly and accurately, taking advantage of the algebraic modeling and procedural programming language, Xpress-Mosel, that allows to interact with the Xpress solver engines in a easy-to-learn way, and its unified modeling interface for all solvers, from linear to general nonlinear solvers.

[1]  Jean-Philippe Vial,et al.  Robust Optimization , 2021, ICORES.

[2]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[3]  Yuanming Shi,et al.  Group Sparse Beamforming for Green Cloud-RAN , 2013, IEEE Transactions on Wireless Communications.

[4]  Michael R. Bussieck,et al.  MINLP Solver Software , 2011 .

[5]  Nikolaos V. Sahinidis,et al.  Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .

[6]  Iain Dunning,et al.  Extended formulations in mixed integer conic quadratic programming , 2015, Mathematical Programming Computation.

[7]  Andrea Lodi,et al.  Mixed integer nonlinear programming tools: a practical overview , 2011, 4OR.

[8]  Nikolaos V. Sahinidis,et al.  A branch-and-reduce approach to global optimization , 1996, J. Glob. Optim..

[9]  Christos G. Cassandras,et al.  Optimal cluster-head deployment in wireless sensor networks with redundant link requirements , 2007, ValueTools '07.

[10]  Jeff T. Linderoth,et al.  Algorithms and Software for Convex Mixed Integer Nonlinear Programs , 2012 .

[11]  Frédéric Messine,et al.  Deterministic global optimization using interval constraint propagation techniques , 2004, RAIRO Oper. Res..

[12]  Hakan Erdogan,et al.  A mixed integer linear programming formulation for the sparse recovery problem in compressed sensing , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[13]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[14]  Erling D. Andersen,et al.  Presolving in linear programming , 1995, Math. Program..

[15]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[16]  Timo Berthold.  Heuristic algorithms in global MINLP solvers , 2014 .

[17]  Hanif D. Sherali,et al.  Optimal Spectrum Sharing for Multi-Hop Software Defined Radio Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[18]  im Fach Mathematik , .

[19]  C. Floudas.  Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications , 1995 .

[20]  Hanif D. Sherali,et al.  Spectrum Sharing for Multi-Hop Networking with Cognitive Radios , 2008, IEEE Journal on Selected Areas in Communications.

[21]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..

[22]  Oktay Günlük,et al.  Perspective reformulations of mixed integer nonlinear programs with indicator variables , 2010, Math. Program..