A framework for globally optimizing mixed-integer signomial programs
From MaRDI portal
Publication:398656
DOI10.1007/s10957-013-0396-3zbMath1303.90074OpenAlexW2022623166WikidataQ62015636 ScholiaQ62015636MaRDI QIDQ398656
Christodoulos A. Floudas, Ruth Misener
Publication date: 15 August 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10044/1/15512
Related Items
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms, Sufficient pruning conditions for MINLP in gas network design, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, SUSPECT: MINLP special structure detector for Pyomo, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, A primal heuristic for optimizing the topology of gas networks based on dual information, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- GLOMIQO: global mixed-integer quadratic optimizer
- On the optimal design of water distribution networks: a practical MINLP approach
- Reduced RLT representations for nonconvex polynomial programming problems
- Convex envelopes of products of convex and component-wise concave functions
- Convergence rate of McCormick relaxations
- SCIP: solving constraint integer programs
- The design of the Boost interval arithmetic library
- A review of recent advances in global optimization
- A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
- 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
- Convexity of products of univariate functions and convexification transformations for geometric programming
- Reformulation in mathematical programming: An application to quantum chemistry
- Some transformation techniques with applications in global optimization
- 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
- A convex envelope formula for multilinear functions
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Convex envelopes of monomials of odd degree
- 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
- Product disaggregation in global optimization and relaxations of rational programs
- Construction of convex relaxations using automated code generation techniques
- 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
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Analyzing the computational impact of MIQCP solver components
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- On convex relaxations of quadrilinear terms
- Deterministic global optimization. Theory, methods and applications
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization for molecular conformation problems
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Global optimization in stabilizing controller design
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- Geometric programming with signomials
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Global Optimization of Mixed-Integer Signomial Programming Problems
- Extending a CIP Framework to Solve MIQCPs
- On jet-convex functions and their tensor products
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Convex underestimation strategies for signomial functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- McCormick-Based Relaxations of Algorithms
- LAPACK Users' Guide
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On the Composition of Convex Envelopes for Quadrilinear Terms
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Surface tension-induced global instability of planar jets and wakes
- Generalized Polynomial Optimization
- Duality Theory for Geometric Programming
- On Descent from Local Minima
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Benchmarking optimization software with performance profiles.
