Pages that link to "Item:Q1621693"

The following pages link to A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693):

Displaying 22 items.

• An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
• Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
• A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems (Q2022241) (← links)
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method (Q2046304) (← links)
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
• Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
• SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
• Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations (Q2097651) (← links)
• Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
• Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
• Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
• Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization (Q2689856) (← links)
• The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
• A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
• Efficient joint object matching via linear programming (Q6052052) (← links)
• Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)
• On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
• Finding Symmetry Groups of Some Quadratic Programming Problems (Q6191771) (← links)
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)