Global optimization of general non-convex problems with intermediate bilinear substructures
From MaRDI portal
Recommendations
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Linearity embedded in nonconvex programs
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of nonconvex problems with convex-transformable intermediates
- Global optimization of nonconvex problems with multilinear intermediates
Cites work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A new reformulation-linearization technique for bilinear programming problems
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex envelopes generated from finitely many compact convex sets
- Convex extensions and envelopes of lower semi-continuous functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Handbook of global optimization
- Jointly Constrained Biconvex Programming
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Product disaggregation in global optimization and relaxations of rational programs
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
Cited in
(20)- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Domain reduction techniques for global NLP and MINLP optimization
- Global optimization of nonconvex problems with convex-transformable intermediates
- Convexification of bilinear forms through non-symmetric lifting
- Tightening methods based on nontrivial bounds on bilinear terms
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Tuning BARON using derivative-free optimization algorithms
- Global optimization of nonconvex problems with multilinear intermediates
- Linearity embedded in nonconvex programs
- Improved convex and concave relaxations of composite bilinear forms
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- scientific article; zbMATH DE number 1054667 (Why is no real title available?)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Global solution of non-convex quadratically constrained quadratic programs
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Solving continuous and discrete nonlinear programs with BARON
Describes a project that uses
Uses Software
This page was built for publication: Global optimization of general non-convex problems with intermediate bilinear substructures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746708)
