Pages that link to "Item:Q1888142"

The following pages link to Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes (Q1888142):

Displayed 45 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)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) ‎ (← 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)
• New multi-commodity flow formulations for the pooling problem (Q524906) ‎ (← links)
• A review of recent advances in global optimization (Q842710) ‎ (← links)
• Convex underestimation for posynomial functions of positive variables (Q941023) ‎ (← links)
• Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) ‎ (← links)
• A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) ‎ (← links)
• Piecewise-linear approximations of multidimensional functions (Q970578) ‎ (← links)
• Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) ‎ (← links)
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) ‎ (← links)
• Deriving convex hulls through lifting and projection (Q1646568) ‎ (← links)
• On linear programming relaxations for solving polynomial programming problems (Q1654348) ‎ (← links)
• An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) ‎ (← links)
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) ‎ (← links)
• Complete mixed integer linear programming formulations for modularity density based clustering (Q1751238) ‎ (← 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)
• Trigonometric convex underestimator for the base functions in Fourier space (Q1777592) ‎ (← 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)
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) ‎ (← links)
• Convex envelopes generated from finitely many compact convex sets (Q1942266) ‎ (← links)
• A review of deterministic optimization methods in engineering and management (Q1955154) ‎ (← links)
• On convex relaxations of quadrilinear terms (Q1959235) ‎ (← 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)
• 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)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) ‎ (← links)
• Multivariate McCormick relaxations (Q2250101) ‎ (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) ‎ (← links)
• Global optimization of nonconvex problems with multilinear intermediates (Q2356333) ‎ (← links)
• Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) ‎ (← links)
• Error bounds for monomial convexification in polynomial optimization (Q2414910) ‎ (← links)
• Relaxations of factorable functions with convex-transformable intermediates (Q2452375) ‎ (← links)
• Convex relaxation for solving posynomial programs (Q2655346) ‎ (← links)
• (Q2861492) ‎ (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) ‎ (← links)
• On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) ‎ (← links)
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) ‎ (← links)
• Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) ‎ (← links)
• Performance of convex underestimators in a branch-and-bound framework (Q5963232) ‎ (← links)