Pages that link to "Item:Q1949256"

The following pages link to Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256):

Displaying 47 items.

• Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
• Optimistic MILP modeling of non-linear optimization problems (Q297051) (← 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)
• On the game interpretation of a shadow price process in utility maximization problems under transaction costs (Q377457) (← 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)
• Extended formulations for convex envelopes (Q486393) (← links)
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← 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)
• Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
• Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
• Deriving convex hulls through lifting and projection (Q1646568) (← links)
• Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• Convex and concave envelopes: revisited and new perspectives (Q1728297) (← 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 generated from finitely many compact convex sets (Q1942266) (← links)
• Convex envelopes for ray-concave functions (Q2080818) (← links)
• Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
• Dominating occupancy processes by the independent site approximation (Q2105174) (← 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)
• 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)
• A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• Convex envelope of bivariate cubic functions over rectangular regions (Q2301177) (← links)
• Convex hull representations of special monomials of binary variables (Q2311191) (← links)
• New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← 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)
• Perspective Reformulations of the CTA Problem with <i>L</i>₂ Distances (Q2931708) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
• Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)
• Tractable Relaxations of Composite Functions (Q5085133) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
• On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)