Pages that link to "Item:Q1942266"

The following pages link to Convex envelopes generated from finitely many compact convex sets (Q1942266):

Displaying 30 items.

• Approximated perspective relaxations: a project and lift approach (Q263157) (← 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)
• 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)
• Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← 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)
• Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
• Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
• Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
• Convex envelopes for ray-concave functions (Q2080818) (← links)
• Exact and approximate results for convex envelopes of special structured functions over simplices (Q2141722) (← 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)
• On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
• Convex envelope of bivariate cubic functions over rectangular regions (Q2301177) (← links)
• Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
• Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations (Q2357903) (← links)
• Relaxations of factorable functions with convex-transformable intermediates (Q2452375) (← links)
• Perspective Reformulations of the CTA Problem with <i>L</i>₂ Distances (Q2931708) (← links)
• Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
• A computational study of perspective cuts (Q6062884) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)