Global optimization of general non-convex problems with intermediate bilinear substructures
From MaRDI portal
Publication:5746708
DOI10.1080/10556788.2013.783032zbMath1285.90043OpenAlexW2079585172MaRDI QIDQ5746708
Nikolaos V. Sahinidis, Keith Zorn
Publication date: 7 February 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2013.783032
mixed-integer nonlinear programmingbranch-and-bound global optimizationreformulation-linearization techniquesfactorable polyhedral relaxation
Related Items
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Domain reduction techniques for global NLP and MINLP optimization, Improved convex and concave relaxations of composite bilinear forms, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Global solution of non-convex quadratically constrained quadratic programs, Global optimization of general nonconvex problems with intermediate polynomial substructures, Tuning BARON using derivative-free optimization algorithms, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment, Convexification of bilinear forms through non-symmetric lifting
Uses Software
Cites Work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new reformulation-linearization technique for bilinear programming problems
- Handbook of global optimization
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Convex extensions and envelopes of lower semi-continuous functions
- A polyhedral branch-and-cut approach to global optimization
- Product disaggregation in global optimization and relaxations of rational programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
