Pages that link to "Item:Q1384437"
From MaRDI portal
The following pages link to Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets (Q1384437):
Displayed 43 items.
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Convex envelopes of products of convex and component-wise concave functions (Q427364) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Easy and optimal queries to reduce set uncertainty (Q1752234) (← links)
- Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
- Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
- Convex envelopes for edge-concave functions (Q1780948) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- Exact and approximate results for convex envelopes of special structured functions over simplices (Q2141722) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
- Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- On convex envelopes for bivariate functions over polytopes (Q2452372) (← links)
- Relaxations of factorable functions with convex-transformable intermediates (Q2452375) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)