GLOMIQO: global mixed-integer quadratic optimizer
From MaRDI portal
Publication:367170
DOI10.1007/S10898-012-9874-7zbMATH Open1272.90034DBLPjournals/jgo/MisenerF13OpenAlexW2026964350WikidataQ62015639 ScholiaQ62015639MaRDI QIDQ367170FDOQ367170
Christodoulos A. Floudas, Ruth Misener
Publication date: 26 September 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10044/1/19682
branch-and-bound global optimizationmathematical programming reformulationsmixed-integer quadratically-constrained quadratic programsnumerical optimization software
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Analyzing the computational impact of MIQCP solver components
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Extending a CIP Framework to Solve MIQCPs
- The global solver in the LINDO API
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- SCIP: solving constraint integer programs
- Benchmarking optimization software with performance profiles.
- An algorithmic framework for convex mixed integer nonlinear programs
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- A polyhedral branch-and-cut approach to global optimization
- Branching rules revisited
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Finding all solutions of nonlinearly constrained systems of equations
- A review of recent advances in global optimization
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A new reformulation-linearization technique for bilinear programming problems
- Handbook of test problems in local and global optimization
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Deterministic global optimization. Theory, methods and applications
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Cutting circles and polygons from area-minimizing rectangles
- A convex envelope formula for multilinear functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Portfolio optimization for wealth-dependent risk preferences
- A new Lagrangean approach to the pooling problem
- Global minimization by reducing the duality gap
- Convex envelopes for edge-concave functions
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Decomposition strategy for the stochastic pooling problem
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
- Pooling Problem: Alternate Formulations and Solution Methods
- Branching and bounds tighteningtechniques for non-convex MINLP
- A bilinear approach to the pooling problem†
- Constraint propagation on quadratic constraints
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Computable representations for convex hulls of low-dimensional quadratic forms
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- Existence and sum decomposition of vertex polyhedral convex envelopes
- On a class of functions attaining their maximum at the vertices of a polyhedron
- Solving long-term financial planning problems via global optimization
- The largest small octagon
- A rigorous global filtering algorithm for quadratic constraints
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Reduced RLT representations for nonconvex polynomial programming problems
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- The small octagon with longest perimeter
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- 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
- On Nonconvex Quadratic Programming with Box Constraints
- Reduction constraints for the global optimization of NLPs
- A scaling algorithm for polynomial constraint satisfaction problems
Cited In (62)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- Using general triangle inequalities within quadratic convex reformulation method
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- A reformulation-linearization technique for optimization over simplices
- Global optimization on non-convex two-way interaction truncated linear multivariate adaptive regression splines using mixed integer quadratic programming
- 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
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- 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
- Dantzig-Wolfe reformulations for binary quadratic 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
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- Linear and parabolic relaxations for quadratic constraints
- 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
- Global solution of non-convex quadratically constrained quadratic programs
- Improved convex and concave relaxations of composite bilinear forms
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Packing ellipsoids by nonlinear optimization
- Global optimality bounds for the placement of control valves in water supply networks
- A MIQCP formulation for B-spline constraints
- Solving Quadratic Programming by Cutting Planes
- 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
- GloMIQO
- 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
- 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
- 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
- Mathematical programming formulations for piecewise polynomial functions
- 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
- 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
- Three enhancements for optimization-based bound tightening
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
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)
