GloMIQO

swMATH6266MaRDI QIDQ18398FDOQ18398

Author name not available (Why is that?)

Described by source

• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
• GLOMIQO: global mixed-integer quadratic optimizer

Cited In (83)

• Tractable Relaxations of Composite Functions
• Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations
• Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics
• Dantzig-Wolfe reformulations for binary quadratic problems
• A global optimization approach for a class of MINLP problems with applications to crude oil scheduling problem
• Bi-objective design-for-control of water distribution networks with global bounds
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
• Optimization and validation of pumping system design and operation for water supply in high-rise buildings
• Global optimality bounds for the placement of control valves in water supply networks
• Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
• Mathematical programming formulations for piecewise polynomial functions
• A reformulation-linearization technique for optimization over simplices
• Title not available (Why is that?)
• Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
• SUSPECT: MINLP special structure detector for Pyomo
• A computational study of primal heuristics inside an MI(NL)P solver
• QPLIB: a library of quadratic programming instances
• ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
• Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
• A partial outer convexification approach to control transmission lines
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• Global optimization of bilinear programs with a multiparametric disaggregation technique
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• A new branch and bound algorithm for integer quadratic programming problems
• Title not available (Why is that?)
• Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
• Linear and parabolic relaxations for quadratic constraints
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Linear transformation based solution methods for non-convex mixed integer quadratic programs
• Global solution of non-convex quadratically constrained quadratic programs
• Improved convex and concave relaxations of composite bilinear forms
• Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• Packing ellipsoids by nonlinear optimization
• A MIQCP formulation for B-spline constraints
• A disjunctive cut strengthening technique for convex MINLP
• Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces
• Title not available (Why is that?)
• Solving Quadratic Programming by Cutting Planes
• The Running Intersection Relaxation of the Multilinear Polytope
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• A model for clustering data from heterogeneous dissimilarities
• On decomposability of multilinear sets
• A framework for globally optimizing mixed-integer signomial programs
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
• Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
• A computational study of global optimization solvers on two trust region subproblems
• A customized branch-and-bound approach for irregular shape nesting
• An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
• Global optimization of MIQCPs with dynamic piecewise relaxations
• Global optimization of general non-convex problems with intermediate bilinear substructures
• Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
• A note on convex reformulation schemes for mixed integer quadratic programs
• Exact and fast algorithms for mixed-integer nonlinear programming
• Minotaur: a mixed-integer nonlinear optimization toolkit
• Cutting ellipses from area-minimizing rectangles
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
• A fully general, exact algorithm for nesting irregular shapes
• Error bounds for monomial convexification in polynomial optimization
• Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption
• Relaxations and discretizations for the pooling problem
• New multi-commodity flow formulations for the pooling problem
• The Convex Hull of a Quadratic Constraint over a Polytope
• Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
• Analyzing the computational impact of MIQCP solver components
• Global optimization algorithm for mixed integer quadratically constrained quadratic program
• Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
• Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
• Global optimization of general nonconvex problems with intermediate polynomial substructures
• Multivariate McCormick relaxations
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
• Extended formulations for convex hulls of some bilinear functions
• Three enhancements for optimization-based bound tightening
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP

This page was built for software: GloMIQO