A framework for globally optimizing mixed-integer signomial programs
From MaRDI portal
Recommendations
- Global optimization of mixed-integer signomial programming problems
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Global optimization of mixed-integer models with quadratic and signomial functions: a review
- Global solution of optimization problems with signomial parts
- GLOMIQO: global mixed-integer quadratic optimizer
Cites work
- 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 Modeling Language for Mathematical Programming
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A convex envelope formula for multilinear functions
- A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
- 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
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An algorithmic framework for convex mixed integer nonlinear programs
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- 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
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Construction of convex relaxations using automated code generation techniques
- Convergence rate of McCormick relaxations
- Convex envelopes for edge-concave functions
- Convex envelopes generated from finitely many compact convex sets
- Convex envelopes of monomials of odd degree
- Convex envelopes of products of convex and component-wise concave functions
- Convex underestimation strategies for signomial functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convexity of products of univariate functions and convexification transformations for geometric programming
- Deterministic global optimization. Theory, methods and applications
- Duality Theory for Geometric Programming
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Extending a CIP framework to solve MIQCPs
- Finding all solutions of nonlinearly constrained systems of equations
- GLOMIQO: global mixed-integer quadratic optimizer
- Generalized Polynomial Optimization
- Geometric programming with signomials
- Global optimization for molecular conformation problems
- Global optimization in stabilizing controller design
- Global optimization of mixed-integer models with quadratic and signomial functions: a review
- 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
- Global optimization of mixed-integer signomial programming problems
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- Handbook of test problems in local and global optimization
- LAPACK Users' Guide
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- McCormick-Based Relaxations of Algorithms
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- On Descent from Local Minima
- On a class of functions attaining their maximum at the vertices of a polyhedron
- On convex relaxations of quadrilinear terms
- On jet-convex functions and their tensor products
- On the Composition of Convex Envelopes for Quadrilinear Terms
- On the optimal design of water distribution networks: a practical MINLP approach
- Product disaggregation in global optimization and relaxations of rational programs
- Reduced RLT representations for nonconvex polynomial programming problems
- Reformulation in mathematical programming: An application to quantum chemistry
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- SCIP: solving constraint integer programs
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Some transformation techniques with applications in global optimization
- Surface tension-induced global instability of planar jets and wakes
- The design of the Boost interval arithmetic library
- The global solver in the LINDO API
- 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
(16)- SUSPECT: MINLP special structure detector for Pyomo
- GLOMIQO: global mixed-integer quadratic optimizer
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Multivariate McCormick relaxations
- A reformulation framework for global optimization
- Sufficient pruning conditions for MINLP in gas network design
- Global solution of optimization problems with signomial parts
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization of mixed-integer signomial programming problems
- Global optimization of mixed-integer models with quadratic and signomial functions: a review
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- On the mixed integer signomial programming problems
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
Describes a project that uses
Uses Software
This page was built for publication: A framework for globally optimizing mixed-integer signomial programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398656)
