Convex envelopes of bounded monomials on two-variable cones

DOI10.1007/S10107-025-02212-5MaRDI QIDQ6988558zbMATH OpenFDO

Authors Pietro Belotti

Publication date 4 May 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-025-02212-5

zbMATH Keywords

volumebranchingmonomialsconvex envelope

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11) Polynomial optimization (90C23)

Cites work

• A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
• A convex envelope formula for multilinear functions
• A tutorial on geometric programming
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
• An efficient global approach for posynomial geometric programming problems
• BARON: A general purpose global optimization software package
• Branching and bounds tighteningtechniques for non-convex MINLP
• Branching rules revisited
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Convex hull representations for bounded products of variables
• Convex relaxation for solving posynomial programs
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Deriving convex hulls through lifting and projection
• Digital Circuit Optimization via Geometric Programming
• Experimental validation of volume-based comparison for double-McCormick relaxations
• Experiments in mixed-integer linear programming
• Geometric Programming for Optimal Positive Linear Systems
• Geometric Programming: Methods, Computations and Applications
• Interval Methods for Systems of Equations
• Jointly Constrained Biconvex Programming
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• Quantifying double McCormick
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• Valid inequalities and convex hulls for multilinear functions

This page was built for publication: Convex envelopes of bounded monomials on two-variable cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988558)