Gaining or losing perspective

DOI10.1007/s10898-021-01055-6zbMath1490.90199arXiv2001.01435OpenAlexW4206289127MaRDI QIDQ2124806

Jon Lee, Daphne E. Skipper, Emily Speakman

Publication date: 11 April 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.01435

zbMATH Keywords

volumerelaxationpolytopeperspectiveintegermixed-integer nonlinear optimizationexponential conehigher-dimensional power cone

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items

Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions

Uses Software

• SDPT3
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• A decomposition of 2-weak vertex-packing polytopes
• Geometric comparison of combinatorial polytopes
• The volume of relaxed Boolean-quadric and cut polytopes
• Theoretical challenges towards cutting-plane selection
• Virtuous smoothing for global optimization
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• Experimental validation of volume-based comparison for double-McCormick relaxations
• Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes
• Volume computation for sparse Boolean quadric relaxations
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Quantifying Double McCormick
• More Virtuous Smoothing
• Optimal Cutting Planes from the Group Relaxations