GLOMIQO: global mixed-integer quadratic optimizer
From MaRDI portal
Recommendations
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- A framework for globally optimizing mixed-integer signomial programs
- Global solution of non-convex quadratically constrained quadratic programs
Cites work
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 2068059 (Why is no real title available?)
- scientific article; zbMATH DE number 2068068 (Why is no real title available?)
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- A bilinear approach to the pooling problem†
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A branch-and-reduce approach to global optimization
- A convex envelope formula for multilinear functions
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A new Lagrangean approach to the pooling problem
- A new reformulation-linearization technique for bilinear programming problems
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A review of recent advances in global optimization
- A rigorous global filtering algorithm for quadratic constraints
- A scaling algorithm for polynomial constraint satisfaction problems
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- An algorithmic framework for convex mixed integer nonlinear programs
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Analyzing the computational impact of MIQCP solver components
- Benchmarking optimization software with performance profiles.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branching rules revisited
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Constraint propagation on quadratic constraints
- Convex envelopes for edge-concave functions
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Cutting circles and polygons from area-minimizing rectangles
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Decomposition strategy for the stochastic pooling problem
- Deterministic global optimization. Theory, methods and applications
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Extending a CIP framework to solve MIQCPs
- Finding all solutions of nonlinearly constrained systems of equations
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Global minimization by reducing the duality gap
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Handbook of test problems in local and global optimization
- Jointly Constrained Biconvex Programming
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- On a class of functions attaining their maximum at the vertices of a polyhedron
- On nonconvex quadratic programming with box constraints
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Pooling problem: alternate formulations and solution methods
- Portfolio optimization for wealth-dependent risk preferences
- Reduced RLT representations for nonconvex polynomial programming problems
- Reduction constraints for the global optimization of NLPs
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Rigorous enclosures of ellipsoids and directed Cholesky factorizations
- SCIP: solving constraint integer programs
- Selected papers presented at the conference on the state of the art in global optimization: computational methods and applications, Princeton, NJ, USA, April 28-30, 1995
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Solving long-term financial planning problems via global optimization
- The global solver in the LINDO API
- The largest small octagon
- The small octagon with longest perimeter
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(67)- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- SUSPECT: MINLP special structure detector for Pyomo
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- A computational study of primal heuristics inside an MI(NL)P solver
- QPLIB: a library of quadratic programming instances
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- 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
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- A partial outer convexification approach to control transmission lines
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Dantzig-Wolfe reformulations for binary quadratic problems
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Dual adaptive model predictive control
- Bi-objective design-for-control of water distribution networks with global bounds
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
- Linear and parabolic relaxations for quadratic constraints
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Optimization and validation of pumping system design and operation for water supply in high-rise buildings
- Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
- Global solution of non-convex quadratically constrained quadratic programs
- A Method for Global Optimization of Large Systems of Quadratic Constraints
- Using general triangle inequalities within quadratic convex reformulation method
- Improved convex and concave relaxations of composite bilinear forms
- Packing ellipsoids by nonlinear optimization
- Global optimality bounds for the placement of control valves in water supply networks
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- A MIQCP formulation for B-spline constraints
- GloMIQO
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A model for clustering data from heterogeneous dissimilarities
- A framework for globally optimizing mixed-integer signomial programs
- Solving Quadratic Programming by Cutting Planes
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- 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
- 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
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- 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
- A fully general, exact algorithm for nesting irregular shapes
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Mathematical programming formulations for piecewise polynomial functions
- A reformulation-linearization technique for optimization over simplices
- Global optimization of mixed-integer models with quadratic and signomial functions: a review
- Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Analyzing the computational impact of MIQCP solver components
- 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
- Global optimization on non-convex two-way interaction truncated linear multivariate adaptive regression splines using mixed integer quadratic programming
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Three enhancements for optimization-based bound tightening
Describes a project that uses
Uses Software
This page was built for publication: GLOMIQO: global mixed-integer quadratic optimizer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367170)
