Pages that link to "Item:Q2356333"

The following pages link to Global optimization of nonconvex problems with multilinear intermediates (Q2356333):

Displaying 17 items.

• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
• A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← 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)
• Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← 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)
• Multivariate McCormick relaxations (Q2250101) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
• Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
• Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
• Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)
• On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
• A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← links)