GLOMIQO: global mixed-integer quadratic optimizer
From MaRDI portal
Publication:367170
DOI10.1007/s10898-012-9874-7zbMath1272.90034OpenAlexW2026964350WikidataQ62015639 ScholiaQ62015639MaRDI QIDQ367170
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) Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, ARGONAUT: algorithms for global optimization of constrained grey-box computational problems, Linear transformation based solution methods for non-convex mixed integer quadratic programs, Minotaur: a mixed-integer nonlinear optimization toolkit, Dantzig-Wolfe reformulations for binary quadratic problems, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, Linear and parabolic relaxations for quadratic constraints, Bi-objective design-for-control of water distribution networks with global bounds, Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach, Optimization and validation of pumping system design and operation for water supply in high-rise buildings, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Packing ellipsoids by nonlinear optimization, Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A model for clustering data from heterogeneous dissimilarities, A MIQCP formulation for B-spline constraints, Global optimization of MIQCPs with dynamic piecewise relaxations, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, A computational study of global optimization solvers on two trust region subproblems, A customized branch-and-bound approach for irregular shape nesting, Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, Dual adaptive model predictive control, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Global optimization of bilinear programs with a multiparametric disaggregation technique, SUSPECT: MINLP special structure detector for Pyomo, Mathematical programming formulations for piecewise polynomial functions, A framework for globally optimizing mixed-integer signomial programs, A partial outer convexification approach to control transmission lines, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Global optimization on non-convex two-way interaction truncated linear multivariate adaptive regression splines using mixed integer quadratic programming, Using general triangle inequalities within quadratic convex reformulation method, A reformulation-linearization technique for optimization over simplices, Improved convex and concave relaxations of composite bilinear forms, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Solving Quadratic Programming by Cutting Planes, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption, Global solution of non-convex quadratically constrained quadratic programs, Global optimization algorithm for mixed integer quadratically constrained quadratic program, A computational study of primal heuristics inside an MI(NL)P solver, Three enhancements for optimization-based bound tightening, Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems, A fully general, exact algorithm for nesting irregular shapes, Cutting ellipses from area-minimizing rectangles, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, Global optimization of general nonconvex problems with intermediate polynomial substructures, A note on convex reformulation schemes for mixed integer quadratic programs, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, QPLIB: a library of quadratic programming instances, Piecewise Linear Function Fitting via Mixed-Integer Linear Programming, GloMIQO, Global optimality bounds for the placement of control valves in water supply networks, Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduced RLT representations for nonconvex polynomial programming problems
- Constraint propagation on quadratic constraints
- 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
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- SCIP: solving constraint integer programs
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A review of recent advances in global optimization
- The small octagon with longest perimeter
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Existence and sum decomposition of vertex polyhedral convex envelopes
- An algorithmic framework for convex mixed integer nonlinear programs
- A scaling algorithm for polynomial constraint satisfaction problems
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Cutting circles and polygons from area-minimizing rectangles
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A new Lagrangean approach to the pooling problem
- On a class of functions attaining their maximum at the vertices of a polyhedron
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Handbook of test problems in local and global optimization
- Global minimization by reducing the duality gap
- A convex envelope formula for multilinear functions
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Solving long-term financial planning problems via global optimization
- The largest small octagon
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- A rigorous global filtering algorithm for quadratic constraints
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- 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
- Branching rules revisited
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Finding all solutions of nonlinearly constrained systems of equations
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- 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
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Decomposition strategy for the stochastic pooling problem
- Analyzing the computational impact of MIQCP solver components
- Portfolio optimization for wealth-dependent risk preferences
- Deterministic global optimization. Theory, methods and applications
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Extending a CIP Framework to Solve MIQCPs
- Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
- Pooling Problem: Alternate Formulations and Solution Methods
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- 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
- On Nonconvex Quadratic Programming with Box Constraints
- Jointly Constrained Biconvex Programming
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A bilinear approach to the pooling problem†
- Reduction constraints for the global optimization of NLPs
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Benchmarking optimization software with performance profiles.
