Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
From MaRDI portal
Publication:628648
DOI10.1007/S11590-010-0228-4zbMATH Open1211.90186OpenAlexW2013083658MaRDI QIDQ628648FDOQ628648
Ignacio E. Grossmann, Juan P. Ruiz
Publication date: 14 March 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0228-4
Cites Work
- CONOPT—A Large-Scale GRG Code
- Title not available (Why is that?)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A new reformulation-linearization technique for bilinear programming problems
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
Cited In (11)
- QPLIB: a library of quadratic programming instances
- On zero duality gap in nonconvex quadratic programming problems
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Convexification of bilinear forms through non-symmetric lifting
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- GLOMIQO: global mixed-integer quadratic optimizer
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Relaxations and discretizations for the pooling problem
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
Uses Software
Recommendations
- Improved convex and concave relaxations of composite bilinear forms 👍 👎
- Linearity embedded in nonconvex programs 👍 👎
- Global optimization of general non-convex problems with intermediate bilinear substructures 👍 👎
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms 👍 👎
- Convex relaxations for mixed-integer nonlinear programs 👍 👎
This page was built for publication: Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628648)
