A new framework to relax composite functions in nonlinear programs
From MaRDI portal
Publication:2235154
DOI10.1007/S10107-020-01541-XzbMATH Open1478.90063OpenAlexW3042590498MaRDI QIDQ2235154FDOQ2235154
Authors: Taotao He, Mohit Tawarmalani 
Publication date: 20 October 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01541-x
Recommendations
computational geometryfactorable programmingabstractions of outer approximationsmixed-integer nonlinear programspolynomial equivalence of separations
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- An efficient algorithm for determining the convex hull of a finite planar set
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization.
- Convex extensions and envelopes of lower semi-continuous functions
- A polyhedral branch-and-cut approach to global optimization
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Title not available (Why is that?)
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Computable representations for convex hulls of low-dimensional quadratic forms
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- The Convex Envelope of (n–1)-Convex Functions
- Convex envelopes of products of convex and component-wise concave functions
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Two-term disjunctions on the second-order cone
- Some results on the strength of relaxations of multilinear functions
- On convex relaxations of quadrilinear terms
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Global optimization of nonconvex problems with multilinear intermediates
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Extended formulations for convex hulls of some bilinear functions
- Three enhancements for optimization-based bound tightening
- Concave envelopes of monomial functions over rectangles
- Deriving convex hulls through lifting and projection
- A class of valid inequalities for multilinear 0-1 optimization problems
- A polyhedral study of binary polynomial programs
- Quantifying double McCormick
- The multilinear polytope for acyclic hypergraphs
- Tighter McCormick relaxations through subgradient propagation
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
Cited In (6)
- Relaxations of factorable functions with convex-transformable intermediates
- MIP relaxations in factorable programming
- Tractable relaxations of composite functions
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Multivariate McCormick relaxations
This page was built for publication: A new framework to relax composite functions in nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235154)
