Global optimization of general nonconvex problems with intermediate polynomial substructures
From MaRDI portal
Publication:2250104
DOI10.1007/s10898-014-0190-2zbMath1301.90066MaRDI QIDQ2250104
Nikolaos V. Sahinidis, Keith Zorn
Publication date: 4 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0190-2
polynomial programming; branch-and-bound global optimization; reformulation-linearization techniques; factorable polyhedral relaxation
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- Convex envelopes of products of convex and component-wise concave functions
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Theory of semidefinite programming for sensor network localization
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new reformulation-linearization technique for bilinear programming problems
- 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 envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex extensions and envelopes of lower semi-continuous functions
- Application of Bernstein expansion to the solution of control problems
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- 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
- A branch-and-reduce approach to global optimization
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- Global optimization of nonconvex problems with multilinear intermediates
- Relaxations of factorable functions with convex-transformable intermediates
- 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
- Portfolio selection with higher moments
- On the Relation Between Option and Stock Prices: A Convex Optimization Approach
- 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
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Global optimization of nonconvex factorable programming problems
