Convex Relaxations for Mixed-Integer Nonlinear Programs

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

[2]  N. Sahinidis,et al.  Global optimization of nonconvex NLPs and MINLPs with applications in process design , 1995 .

[3]  Timo Berthold,et al.  Rounding and Propagation Heuristics for Mixed Integer Programming , 2011, OR.

[4]  Achim Kienle,et al.  Global Bounds on Optimal Solutions for the Production of 2,3 Dimethylbutene-1 , 2006 .

[5]  W. Marquardt,et al.  Efficient Optimization-Based Design of Distillation Columns for Homogenous Azeotropic Mixtures , 2006 .

[6]  Jeff T. Linderoth.  A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs , 2005, Math. Program..

[7]  On convex envelopes and underestimators for bivariate functions , 2009 .

[8]  Marco Mazzotti,et al.  Design of Simulated Moving Bed Separations: Generalized Langmuir Isotherm , 2006 .

[9]  Massimo Morbidelli,et al.  Robust design of binary countercurrent adsorption separation processes , 1993 .

[10]  Hanif D. Sherali,et al.  Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts , 2012, Comput. Optim. Appl..

[11]  Yahia Lebbah,et al.  A Rigorous Global Filtering Algorithm for Quadratic Constraints* , 2004, Constraints.

[12]  Martin Ballerstein,et al.  Extended formulations for convex envelopes , 2014, J. Glob. Optim..

[13]  R. Weismantel,et al.  Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations , 2015 .

[14]  R. Kent Dybvig,et al.  Revised5 Report on the Algorithmic Language Scheme , 1986, SIGP.

[15]  Christodoulos A. Floudas,et al.  Convex envelopes for edge-concave functions , 2005, Math. Program..

[16]  Nikolaos V. Sahinidis,et al.  Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques , 2001, J. Glob. Optim..

[17]  Christodoulos A. Floudas,et al.  Trilinear Monomials with Mixed Sign Domains: Facets of the Convex and Concave Envelopes , 2004, J. Glob. Optim..

[18]  Alberto Caprara,et al.  Global optimization problems and domain reduction strategies , 2010, Math. Program..

[19]  R. Baker Kearfott.  Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization , 2006 .

[20]  Nikolaos V. Sahinidis,et al.  Convex envelopes generated from finitely many compact convex sets , 2013, Math. Program..

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

[22]  Jochen Strube,et al.  Design and optimization of a hybrid distillation/melt crystallization process , 2008 .

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

[24]  Timo Berthold,et al.  Extending a CIP framework to solve MIQCPs , 2012 .

[25]  Samuel Burer,et al.  Computable representations for convex hulls of low-dimensional quadratic forms , 2010, Math. Program..

[26]  Kurt M. Anstreicher,et al.  Institute for Mathematical Physics Semidefinite Programming versus the Reformulation–linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming Semidefinite Programming versus the Reformulation-linearization Technique for Nonconvex Quadratically Constrained , 2022 .

[27]  Michael R. Bussieck,et al.  MINLPLib - A Collection of Test Models for Mixed-Integer Nonlinear Programming , 2003, INFORMS J. Comput..

[28]  Pio A. Aguirre,et al.  Optimal Synthesis of Multicomponent Zeotropic Distillation Processes. 1. Preprocessing Phase and Rigorous Optimization for a Single Unit , 2002 .

[29]  Arvind Rajendran,et al.  Simulated moving bed chromatography for the separation of enantiomers. , 2009, Journal of chromatography. A.

[30]  I. Grossmann,et al.  Disjunctive Programming Models for the Optimal Design of Distillation Columns and Separation Sequences , 2000 .

[31]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[32]  Isaac Siwale.  ON GLOBAL OPTIMIZATION , 2015 .

[33]  K. Roberts,et al.  Thesis , 2002 .

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

[35]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[36]  Achim Kienle,et al.  Global analysis of combined reaction distillation processes , 2008, Comput. Chem. Eng..

[37]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems , 2005, Ann. Oper. Res..

[38]  Christodoulos A. Floudas,et al.  Trilinear Monomials with Positive or Negative Domains: Facets of the Convex and Concave Envelopes , 2004 .

[39]  Hanif D. Sherali,et al.  A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..

[40]  C. H. Giles,et al.  786. Studies in adsorption. Part XI. A system of classification of solution adsorption isotherms, and its use in diagnosis of adsorption mechanisms and in measurement of specific surface areas of solids , 1960 .

[41]  Adam N. Letchford,et al.  On Nonconvex Quadratic Programming with Box Constraints , 2009, SIAM J. Optim..

[42]  Robert Weismantel,et al.  The Convex Envelope of (n--1)-Convex Functions , 2008, SIAM J. Optim..

[43]  Hanif D. Sherali,et al.  Reduced RLT representations for nonconvex polynomial programming problems , 2012, J. Glob. Optim..

[44]  Lionel Pournin,et al.  The Flip-Graph of the 4-Dimensional Cube is Connected , 2012, Discret. Comput. Geom..

[45]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..

[46]  Hanif D. Sherali,et al.  Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents , 1998, J. Glob. Optim..

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

[48]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2008, Math. Program..

[49]  Carlile Lavor,et al.  On generating Instances for the Molecular Distance Geometry Problem , 2006 .

[50]  Angelo Lucia,et al.  Distillation pinch points and more , 2008, Comput. Chem. Eng..

[51]  Christodoulos A. Floudas,et al.  A New Class of Improved Convex Underestimators for Twice Continuously Differentiable Constrained NLPs , 2004, J. Glob. Optim..

[52]  E. W. Morris.  No , 1923, The Hospital and health review.

[53]  Hanif D. Sherali,et al.  Global optimization of nonconvex factorable programming problems , 2001, Math. Program..

[54]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..

[55]  Achim Kienle,et al.  Design of simulated moving bed processes under reduced purity requirements. , 2007, Journal of chromatography. A.

[56]  D. Ruthven,et al.  Counter-current and simulated counter-current adsorption separation processes , 1989 .

[57]  Anatoliy D. Rikun,et al.  A Convex Envelope Formula for Multilinear Functions , 1997, J. Glob. Optim..

[58]  Harold P. Benson.  On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals , 2004, Comput. Optim. Appl..

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

[60]  Andreas Seidel-Morgenstern,et al.  A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization , 2007, Comput. Chem. Eng..

[61]  Anita M. Katti,et al.  Fundamentals of Preparative and Nonlinear Chromatography , 1994 .

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

[63]  Michael Joswig,et al.  polymake: a Framework for Analyzing Convex Polytopes , 2000 .

[64]  Christodoulos A Floudas,et al.  Global minimum potential energy conformations of small molecules , 1994, J. Glob. Optim..

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

[66]  Sonia Cafieri,et al.  On convex relaxations of quadrilinear terms , 2010, J. Glob. Optim..

[67]  K. Hidajat,et al.  Comparative study of flow schemes for a simulated countercurrent adsorption separation process , 1992 .

[68]  Bernd Sturmfels,et al.  The hyperdeterminant and triangulations of the 4-cube , 2006, Math. Comput..

[69]  Andreas Seidel-Morgenstern,et al.  A theoretical study of continuous counter-current chromatography for adsorption isotherms with inflection points , 2010, Comput. Chem. Eng..