GLOMIQO: global mixed-integer quadratic optimizer (Q367170): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 21:49, 13 November 2024

scientific article

Language	Label	Description	Also known as
English	GLOMIQO: global mixed-integer quadratic optimizer	scientific article

Statements

scholarly article

0 references

GLOMIQO: global mixed-integer quadratic optimizer (English)

0 references

0 references

Christodoulos A. Floudas

0 references

Journal of Global Optimization

0 references

publication date

26 September 2013

0 references

full work available at URL

http://hdl.handle.net/10044/1/19682

0 references

zbMATH Keywords

mixed-integer quadratically-constrained quadratic programs

0 references

numerical optimization software

0 references

mathematical programming reformulations

0 references

branch-and-bound global optimization

0 references

describes a project that uses

COIN-OR/GAMSLinks

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

SCIP: solving constraint integer programs

0 references

Branching rules revisited

0 references

Constraint Integer Programming: A New Approach to Integrate CP and MIP

0 references

0 references

Jointly Constrained Biconvex Programming

0 references

A new Lagrangean approach to the pooling problem

0 references

On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

0 references

\(\alpha BB\): A global optimization method for general constrained nonconvex problems

0 references

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

0 references

Computable representations for convex hulls of low-dimensional quadratic forms

0 references

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

0 references

The largest small octagon

0 references

Pooling Problem: Alternate Formulations and Solution Methods

0 references

The small octagon with longest perimeter

0 references

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

0 references

Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs

0 references

Branching and bounds tighteningtechniques for non-convex MINLP

0 references

Global minimization by reducing the duality gap

0 references

Extending a CIP Framework to Solve MIQCPs

0 references

Analyzing the computational impact of MIQCP solver components

0 references

An algorithmic framework for convex mixed integer nonlinear programs

0 references

On Nonconvex Quadratic Programming with Box Constraints

0 references

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

0 references

MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming

0 references

Decomposition methods for solving nonconvex quadratic programs via branch and bound

0 references

On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square

0 references

Benchmarking optimization software with performance profiles.

0 references

G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems

0 references

A scaling algorithm for polynomial constraint satisfaction problems

0 references

Constraint propagation on quadratic constraints

0 references

Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations

0 references

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

0 references

0 references

Deterministic global optimization. Theory, methods and applications

0 references

A Decomposition Strategy for Global Optimum Search in the Pooling Problem

0 references

A review of recent advances in global optimization

0 references

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

0 references

Handbook of test problems in local and global optimization

0 references

A bilinear approach to the pooling problem†

0 references

0 references

0 references

Cutting circles and polygons from area-minimizing rectangles

0 references

A rigorous global filtering algorithm for quadratic constraints

0 references

Decomposition strategy for the stochastic pooling problem

0 references

Reduction constraints for the global optimization of NLPs

0 references

An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms

0 references

The global solver in the LINDO API

0 references

Finding all solutions of nonlinearly constrained systems of equations

0 references

Solving long-term financial planning problems via global optimization

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

Existence and sum decomposition of vertex polyhedral convex envelopes

0 references

0 references

Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes

0 references

Convex envelopes for edge-concave functions

0 references

0 references

Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations

0 references

Relaxation and decomposition methods for mixed integer nonlinear programming.

0 references

Global optimization algorithms for linearly constrained indefinite quadratic problems

0 references

Column enumeration based decomposition techniques for a class of non-convex MINLP problems

0 references

A convex envelope formula for multilinear functions

0 references

Portfolio optimization for wealth-dependent risk preferences

0 references

Global minimization of large-scale constrained concave quadratic problems by separable programming

0 references

Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks

0 references

A branch-and-reduce approach to global optimization

0 references

Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations

0 references

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

0 references

Reduced RLT representations for nonconvex polynomial programming problems

0 references

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

0 references

A new reformulation-linearization technique for bilinear programming problems

0 references

A reformulation-convexification approach for solving nonconvex quadratic programming problems

0 references

New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems

0 references

On a class of functions attaining their maximum at the vertices of a polyhedron

0 references

0 references

Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications

0 references

Global optimization of mixed-integer nonlinear programs: a theoretical and computational study

0 references

A polyhedral branch-and-cut approach to global optimization

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10898-012-9874-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/jgo/MisenerF13

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:367170

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q367170&oldid=37909472"