Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
From MaRDI portal
(Redirected from Publication:628648)
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
Cites work
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A new reformulation-linearization technique for bilinear programming problems
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- CONOPT—A Large-Scale GRG Code
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Jointly Constrained Biconvex Programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Cited in
(13)- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Convexification of bilinear forms through non-symmetric lifting
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- QPLIB: a library of quadratic programming instances
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- On zero duality gap in nonconvex quadratic programming problems
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Relaxations and discretizations for the pooling problem
- A modulus-based matrix splitting iterative method for a class of vertical linear complementarity problems
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)
