Convergence analysis of multivariate McCormick relaxations
From MaRDI portal
Publication:524904
DOI10.1007/s10898-016-0408-6zbMath1394.90471OpenAlexW2294747177MaRDI QIDQ524904
Alexander Mitsos, Jaromił Najman
Publication date: 27 April 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0408-6
global optimizationHausdorff metricinterval analysisnonconvex optimizationconvergence rateconvex relaxationMcCormick
Related Items (13)
EAGO.jl: easy advanced global optimization in Julia ⋮ Convergence-order analysis of branch-and-bound algorithms for constrained problems ⋮ The cluster problem in constrained global optimization ⋮ Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ Deterministic global optimization with artificial neural networks embedded ⋮ Whitney differentiability of optimal-value functions for bound-constrained convex programming problems ⋮ Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs ⋮ Differentiable McCormick relaxations ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ Global dynamic optimization with Hammerstein-Wiener models embedded ⋮ Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence analysis of Taylor models and McCormick-Taylor models
- A linear time algorithm for the Hausdorff distance between convex polygons
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- The cluster problem revisited
- The cluster problem in multivariate global optimization
- Convex extensions and envelopes of lower semi-continuous functions
- Ellipsoidal techniques for reachability analysis: Internal approximation
- Interval analysis: Theory and applications
- A polyhedral branch-and-cut approach to global optimization
- Rigorous convex underestimators for general twice-differentiable problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Finding all solutions of nonlinearly constrained systems of equations
- Multivariate McCormick relaxations
- Global optimization of bounded factorable functions with discontinuities
- COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
- McCormick-Based Relaxations of Algorithms
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Complete search in continuous global optimization and constraint satisfaction
- Analysis 2
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: Convergence analysis of multivariate McCormick relaxations
