Pages that link to "Item:Q1621693"
From MaRDI portal
The following pages link to A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693):
Displaying 39 items.
- Temporal linear relaxation in IBM ILOG CP optimizer (Q309055) (← links)
- 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 polyhedral branch-and-cut approach to global optimization (Q1780949) (← 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)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← 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)
- Scatter search and local NLP solvers: a multistart framework for global optimization (Q2892345) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- On the Performance of NLP Solvers Within Global MINLP Solvers (Q4685828) (← links)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
- EAGO.jl: easy advanced global optimization in Julia (Q5038425) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
- Efficient joint object matching via linear programming (Q6052052) (← links)
- Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)
- A potential practical algorithm for minimizing the sum of affine fractional functions (Q6106325) (← 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)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- Global algorithm for effectively solving min-max affine fractional programs (Q6584742) (← links)
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs (Q6608035) (← links)
- A reformulation-enumeration MINLP algorithm for gas network design (Q6635812) (← links)
- Partial reformulation-linearization based optimization models for the Golomb ruler problem (Q6658434) (← links)
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations (Q6661112) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
