Cutting planes for signomial programming
From MaRDI portal
Cites work
- A branch-and-cut algorithm for mixed-integer bilinear programming
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- A convex envelope formula for multilinear functions
- A framework for globally optimizing mixed-integer signomial programs
- A new framework to relax composite functions in nonlinear programs
- A note on convexity of two signomial functions
- A polyhedral branch-and-cut approach to global optimization
- A reformulation framework for global optimization
- A Successive Underestimation Method for Concave Minimization Problems
- Algebraic Perspectives on Signomial Optimization
- An analysis of mixed integer linear sets based on lattice point free convex sets
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concave minimization under linear constraints with special structure
- Convex envelopes of bivariate functions through the solution of KKT systems
- Convex envelopes of monomials of odd degree
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convexity Cuts and Cut Search
- Deriving convex hulls through lifting and projection
- Explicit convex and concave envelopes through polyhedral subdivisions
- Finding all solutions of nonlinearly constrained systems of equations
- Fractional 0-1 programming and submodularity
- Global optimization of mixed-integer nonlinear programs with SCIP 8
- Global optimization of nonconvex problems with multilinear intermediates
- Global optimization of signomial geometric programming problems
- Global optimization. From theory to implementation.
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 2068068 (Why is no real title available?)
- Inequalities from Two Rows of a Simplex Tableau
- Integer Programming
- Intersection cuts for factorable MINLP
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Intersection cuts for polynomial optimization
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Jointly Constrained Biconvex Programming
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Linearization method of global optimization for generalized geometric programming
- Linearizing Geometric Programs
- Maximal quadratic-free sets
- Maximizing a class of submodular utility functions
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Mixed-integer nonlinear optimization
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Nonunique lifting of integer variables in minimal inequalities
- On convex envelopes for bivariate functions over polytopes
- On convex relaxations of quadrilinear terms
- On cutting planes for mixed-integer nonlinear programming
- On minimal valid inequalities for mixed integer conic programs
- On the use of intersection cuts for bilevel optimization
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Quantifying double McCormick
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Relative entropy relaxations for signomial optimization
- Relaxations of mixed integer sets from lattice-free polyhedra
- Signomial and polynomial optimization via relative entropy and partial dualization
- Some polyhedra related to combinatorial problems
- Some results on the strength of relaxations of multilinear functions
- Sufficiency of cut-generating functions
- Supermodularity and valid inequalities for quadratic optimization with indicators
- The group-theoretic approach in mixed integer programming
- Tractable relaxations of composite functions
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Two-term disjunctions on the second-order cone
- Writing global optimization software
This page was built for publication: Cutting planes for signomial programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974660)
