Conflict Analysis for MINLP

The generalization of mixed integer program (MIP) techniques to deal with nonlinear, potentially nonconvex, constraints has been a fruitful direction of research for computational mixed integer non...

[1]  Jakob Witzig,et al.  Conflict-Driven Heuristics for Mixed Integer Programming , 2019, INFORMS J. Comput..

[2]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

[3]  Josef Kallrath,et al.  Solving Planning and Design Problems in the Process Industry Using Mixed Integer and Global Optimization , 2005, Ann. Oper. Res..

[4]  C. Floudas.  Global optimization in design and control of chemical process systems , 1998 .

[5]  Jennifer Ryan,et al.  Identifying Minimally Infeasible Subsystems of Inequalities , 1990, INFORMS J. Comput..

[6]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[7]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[8]  T. Westerlund,et al.  An extended cutting plane method for solving convex MINLP problems , 1995 .

[9]  Katta G. Murty,et al.  Linear complementarity, linear and nonlinear programming , 1988 .

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

[11]  Jean-Charles Régin,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems , 2004, Lecture Notes in Computer Science.

[12]  S. Vavasis.  COMPLEXITY ISSUES IN GLOBAL OPTIMIZATION: A SURVEY , 1995 .

[13]  Peter J. Stuckey,et al.  Efficient Intelligent Backtracking Using Linear Programming , 2002, INFORMS J. Comput..

[14]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[15]  Peter J. Stuckey,et al.  Local Rapid Learning for Integer Programs , 2019, CPAIOR.

[16]  I. Grossmann,et al.  An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .

[17]  Christodoulos A. Floudas,et al.  ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations , 2014, Journal of Global Optimization.

[18]  Leo Liberti,et al.  Convex Envelopes of Monomials of Odd Degree , 2003, J. Glob. Optim..

[19]  Christian Kirches,et al.  Mixed-integer nonlinear optimization*† , 2013, Acta Numerica.

[20]  Tobias Achterberg,et al.  Mixed Integer Programming: Analyzing 12 Years of Progress , 2013 .

[21]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

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

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

[24]  Timo Berthold,et al.  Algorithms for discrete nonlinear optimization in FICO Xpress , 2016, 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM).

[25]  Leo Liberti,et al.  A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem , 2008, Int. Trans. Oper. Res..

[26]  Jakob Witzig,et al.  Experiments with Conflict Analysis in Mixed Integer Programming , 2016, CPAIOR.

[27]  Marc E. Pfetsch,et al.  Irreducible Infeasible Subsystems of Semidefinite Systems , 2018, J. Optim. Theory Appl..

[28]  Jakob Witzig,et al.  Computational aspects of infeasibility analysis in mixed integer programming , 2021, Mathematical Programming Computation.

[29]  C. Mészáros.  The BPMPD interior point solver for convex quadratic problems , 1999 .

[30]  G. Consigli,et al.  Optimization Methods in Finance , 2019, Quantitative Finance.

[31]  J. Ben Rosen,et al.  A quadratic assignment formulation of the molecular conformation problem , 1994, J. Glob. Optim..

[32]  N. Chakravarti.  Some results concerning post-infeasibility analysis , 1994 .

[33]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[34]  Omprakash K. Gupta,et al.  Branch and Bound Experiments in Convex Nonlinear Integer Programming , 1985 .

[35]  John W. Chinneck,et al.  Locating Minimal Infeasible Constraint Sets in Linear Programs , 1991, INFORMS J. Comput..

[36]  Jakob Witzig,et al.  A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming , 2019, CPAIOR.

[37]  I. Grossmann,et al.  Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis , 1988 .

[38]  Barry Richards,et al.  Nogood Backmarking with Min-Conflict Repair in Constraint Satisfaction and Optimization , 1994, PPCP.

[39]  Andrea Lodi,et al.  Performance Variability in Mixed-Integer Programming , 2013 .

[40]  Peter J. Stuckey,et al.  Rapid Learning for Binary Programs , 2010, CPAIOR.

[41]  Paolo Toth,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings , 2010, CPAIOR.

[42]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[43]  LeyfferSven,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994 .

[44]  Leo Liberti,et al.  Reformulation in mathematical programming: An application to quantum chemistry , 2009, Discret. Appl. Math..

[45]  Martin W. P. Savelsbergh,et al.  Information-based branching schemes for binary linear mixed integer problems , 2009, Math. Program. Comput..

[46]  T. Sandholm,et al.  Nogood Learning for Mixed Integer Programming , 2006 .

[47]  Nicholas I. M. Gould,et al.  A Note on Performance Profiles for Benchmarking Software , 2016, ACM Trans. Math. Softw..

[48]  Ambros M. Gleixner,et al.  SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework , 2018, Optim. Methods Softw..

[49]  Nikolaos V. Sahinidis,et al.  Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON , 2018, Optim. Methods Softw..

[50]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[51]  Ignacio E. Grossmann,et al.  Systematic Methods of Chemical Process Design , 1997 .

[52]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[53]  Tapio Westerlund,et al.  The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming , 2016, J. Glob. Optim..

[54]  Anders Forsgren,et al.  Primal and dual active-set methods for convex quadratic programming , 2015, Mathematical Programming.

[55]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[56]  C. E. Lemke,et al.  The dual method of solving the linear programming problem , 1954 .

[57]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[58]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[59]  Miles Lubin,et al.  Outer approximation with conic certificates for mixed-integer convex problems , 2018, Math. Program. Comput..

[60]  Timo Berthold,et al.  Hybrid Branching , 2009, CPAIOR.

[61]  Tobias Achterberg,et al.  Conflict analysis in mixed integer programming , 2007, Discret. Optim..

[62]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

[63]  Sven Leyffer,et al.  User manual for filterSQP , 1998 .

[64]  I. Grossmann,et al.  A combined penalty function and outer-approximation method for MINLP optimization : applications to distillation column design , 1989 .

[65]  WächterAndreas,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006 .

[66]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[67]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[68]  Ignacio E. Grossmann,et al.  A review and comparison of solvers for convex MINLP , 2018, Optimization and Engineering.

[69]  J. Tukey,et al.  Variations of Box Plots , 1978 .

[70]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..