Pages that link to "Item:Q1881050"
From MaRDI portal
The following pages link to Global optimization of mixed-integer nonlinear programs: a theoretical and computational study (Q1881050):
Displayed 50 items.
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Convergence analysis of Taylor models and McCormick-Taylor models (Q367158) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Optimization methods for pipeline transportation of natural gas with variable specific gravity and compressibility (Q384516) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- On the optimal design of water distribution networks: a practical MINLP approach (Q400003) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Differentiable McCormick relaxations (Q522264) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (Q530424) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- A numerical study of diagonally split Runge-Kutta methods for PDEs with discontinuities (Q618376) (← links)
- High order strong stability preserving time discretizations (Q618442) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
- Modern tools for the time-discrete dynamics and optimization of gene-environment networks (Q654347) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
- New methods for calculating \(\alpha\)BB-type underestimators (Q742131) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem (Q811896) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Convex reformulations for solving a nonlinear network design problem (Q902090) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)