Convergence analysis of multivariate McCormick relaxations
From MaRDI portal
(Redirected from Publication:524904)
Recommendations
Cites work
- A linear time algorithm for the Hausdorff distance between convex polygons
- A polyhedral branch-and-cut approach to global optimization
- Analysis 2
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
- Convergence analysis of Taylor models and McCormick-Taylor models
- Convergence rate of McCormick relaxations
- Convex extensions and envelopes of lower semi-continuous functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Ellipsoidal techniques for reachability analysis: Internal approximation
- Finding all solutions of nonlinearly constrained systems of equations
- Generalized McCormick relaxations
- Global optimization of bounded factorable functions with discontinuities
- scientific article; zbMATH DE number 1799463 (Why is no real title available?)
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 1461253 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 5053484 (Why is no real title available?)
- scientific article; zbMATH DE number 2209711 (Why is no real title available?)
- Interval analysis: Theory and applications
- McCormick-Based Relaxations of Algorithms
- Multivariate McCormick relaxations
- Rigorous convex underestimators for general twice-differentiable problems
- Semidefinite relaxations of fractional programs via novel convexification techniques
- The cluster problem in multivariate global optimization
- The cluster problem revisited
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
Cited in
(19)- 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
- Deterministic global optimization with artificial neural networks embedded
- Experimental validation of volume-based comparison for double-McCormick relaxations
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Global dynamic optimization with Hammerstein-Wiener models embedded
- On tightness and anchoring of McCormick and other relaxations
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Improved convex and concave relaxations of composite bilinear forms
- Convergence analysis of Taylor models and McCormick-Taylor models
- Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
- EAGO.jl: easy advanced global optimization in Julia
- Differentiable McCormick relaxations
- Convergence rate of McCormick relaxations
- Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs
- MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
- Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions
- Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation
This page was built for publication: Convergence analysis of multivariate McCormick relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q524904)
