ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 09:00, 13 November 2024

scientific article

Language	Label	Description	Also known as
English	ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations	scientific article

Statements

scholarly article

0 references

ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (English)

0 references

0 references

Christodoulos A. Floudas

0 references

Journal of Global Optimization

0 references

publication date

4 July 2014

0 references

zbMATH Keywords

MINLP

0 references

deterministic global optimization

0 references

optimization software

0 references

branch-and-cut

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

COIN-OR/GAMSLinks

0 references

0 references

0 references

Boost Interval Arithmetic

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-014-0166-2

0 references

SCIP: solving constraint integer programs

0 references

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

0 references

Branching rules revisited

0 references

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

0 references

Jointly Constrained Biconvex Programming

0 references

Global optimization in stabilizing controller design

0 references

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

0 references

Recent advances in the solution of quadratic assignment problems

0 references

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

0 references

On convex relaxations for quadratically constrained quadratic programming

0 references

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

0 references

Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs

0 references

Mixed-integer nonlinear optimization

0 references

Branching and bounds tighteningtechniques for non-convex MINLP

0 references

Analyzing the computational impact of MIQCP solver components

0 references

Extending a CIP Framework to Solve MIQCPs

0 references

An algorithmic framework for convex mixed integer nonlinear programs

0 references

On the optimal design of water distribution networks: a practical MINLP approach

0 references

The design of the Boost interval arithmetic library

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

A branch-and-reduce approach to global optimization

0 references

On convex relaxations of quadrilinear terms

0 references

0 references

0 references

Mixed integer nonlinear programming tools: an updated practical overview

0 references

Benchmarking optimization software with performance profiles.

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

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

0 references

0 references

Deterministic global optimization. Theory, methods and applications

0 references

A review of recent advances in global optimization

0 references

Handbook of test problems in local and global optimization

0 references

A Modeling Language for Mathematical Programming

0 references

Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment

0 references

Construction of convex relaxations using automated code generation techniques

0 references

0 references

Elements of Large-Scale Mathematical Programming Part I: Concepts

0 references

Global Optimization of Mixed-Integer Signomial Programming Problems

0 references

Convexity of products of univariate functions and convexification transformations for geometric programming

0 references

Decomposition strategy for the stochastic pooling problem

0 references

Cutting circles and polygons from area-minimizing rectangles

0 references

Cutting ellipses from area-minimizing rectangles

0 references

Convex envelopes of products of convex and component-wise concave functions

0 references

Convex envelopes generated from finitely many compact convex sets

0 references

Global optimization of bilinear programs with a multiparametric disaggregation technique

0 references

A rigorous global filtering algorithm for quadratic constraints

0 references

Convex envelopes of monomials of odd degree

0 references

An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms

0 references

The global solver in the LINDO API

0 references

On convex envelopes for bivariate functions over polytopes

0 references

A survey for the quadratic assignment problem

0 references

A reformulation framework for global optimization

0 references

Some transformation techniques with applications in global optimization

0 references

Convex underestimation strategies for signomial functions

0 references

Finding all solutions of nonlinearly constrained systems of equations

0 references

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

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

A framework for globally optimizing mixed-integer signomial programs

0 references

GLOMIQO: global mixed-integer quadratic optimizer

0 references

Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

0 references

McCormick-Based Relaxations of Algorithms

0 references

Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests

0 references

Relaxation and decomposition methods for mixed integer nonlinear programming.

0 references

A global optimization algorithm for linear fractional and bilinear programs

0 references

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

0 references

A clique algorithm for standard quadratic programming

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 jet-convex functions and their tensor products

0 references

Algorithms for an integer multicommodity network flow problem with node reliability considerations

0 references

0 references

Existence and sum decomposition of vertex polyhedral convex envelopes

0 references

Explicit convex and concave envelopes through polyhedral subdivisions

0 references

Semidefinite relaxations of fractional programs via novel convexification techniques

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

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

0 references

A polyhedral study of nonconvex quadratic programs with box constraints

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10898-014-0166-2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/jgo/MisenerF14

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2250093

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