Improved convex and concave relaxations of composite bilinear forms
From MaRDI portal
Publication:2697000
DOI10.1007/s10957-023-02196-2OpenAlexW4323980071MaRDI QIDQ2697000
Matthew D. Stuber, Matthew E. Wilhelm
Publication date: 17 April 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-023-02196-2
nonconvex programmingbranch-and-bounddeterministic global optimizationMcCormick relaxationsmultilinear products
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- GLOMIQO: global mixed-integer quadratic optimizer
- A reliable affine relaxation method for global optimization
- Reverse propagation of McCormick relaxations
- Differentiable McCormick relaxations
- Convergence analysis of multivariate McCormick relaxations
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- The cluster problem in constrained global optimization
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Domain reduction techniques for global NLP and MINLP optimization
- Corrections to: ``Differentiable McCormick relaxations
- Deterministic global optimization with artificial neural networks embedded
- A polyhedral branch-and-cut approach to global optimization
- BARON: A general purpose global optimization software package
- Tighter McCormick relaxations through subgradient propagation
- Deterministic global optimization with Gaussian processes embedded
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Deterministic global optimization of steam cycles using the IAPWS-IF97 model
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Multivariate McCormick relaxations
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- On tightness and anchoring of McCormick and other relaxations
- Separable concave minimization via partial outer approximation and branch and bound
- Affine arithmetic: concepts and applications
- Interval arithmetic, affine arithmetic, Taylor series methods: Why, what next?
- Erratum to: ``Multivariate McCormick relaxations
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Convex and concave relaxations of implicit functions
- Julia: A Fresh Approach to Numerical Computing
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- McCormick-Based Relaxations of Algorithms
- Concave Minimization Via Collapsing Polytopes
- LAPACK Users' Guide
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- EAGO.jl: easy advanced global optimization in Julia
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs
- An Introduction to Affine Arithmetic
- An updated set of basic linear algebra subprograms (BLAS)
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Benchmarking optimization software with performance profiles.
This page was built for publication: Improved convex and concave relaxations of composite bilinear forms
