Pages that link to "Item:Q1361080"
From MaRDI portal
The following pages link to A convex envelope formula for multilinear functions (Q1361080):
Displaying 50 items.
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- 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)
- Divisive heuristic for modularity density maximization (Q342346) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Convex envelopes of products of convex and component-wise concave functions (Q427364) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← 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)
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- A new global optimization approach for convex multiplicative programming (Q972168) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- Complete mixed integer linear programming formulations for modularity density based clustering (Q1751238) (← links)
- Easy and optimal queries to reduce set uncertainty (Q1752234) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← 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)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
- A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems (Q2010090) (← links)
- Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← links)
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
- Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes (Q2064282) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- Modified modularity density maximization and density ratio heuristic (Q2108173) (← links)
- Graph, clique and facet of Boolean logical polytope (Q2124813) (← links)
- Exact and approximate results for convex envelopes of special structured functions over simplices (Q2141722) (← links)
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones (Q2147137) (← 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)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
