Convergence analysis of Taylor models and McCormick-Taylor models
From MaRDI portal
Publication:367158
DOI10.1007/S10898-012-9998-9zbMATH Open1295.90052OpenAlexW1969747399MaRDI QIDQ367158FDOQ367158
Authors: A. Bompadre, Alexander Mitsos, Benoit Chachuat 
Publication date: 26 September 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10044/1/30364
Recommendations
- Convergence analysis of multivariate McCormick relaxations
- Convergence rate of McCormick relaxations
- On tightness and anchoring of McCormick and other relaxations
- Chebyshev model arithmetic for factorable functions
- Higher order convergence for multidimensional functions with a new Taylor-Bernstein form as inclusion function
global optimizationnonconvex optimizationconvergence rateconvex relaxationsinterval extensionsMcCormick relaxationsMcCormick-Taylor modelsTaylor models
Cites Work
- McCormick-Based Relaxations of Algorithms
- Title not available (Why is that?)
- Interval analysis: Theory and applications
- A computer-assisted proof of universality for area-preserving maps
- Efficient control of the dependency problem based on Taylor model methods
- Validated solutions of initial value problems for parametric ODEs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global minimum potential energy conformations of small molecules
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Title not available (Why is that?)
- Complete search in continuous global optimization and constraint satisfaction
- Suppression of the wrapping effect by Taylor model-based verified integrators: long-term stabilization by preconditioning
- Branching and bounds tighteningtechniques for non-convex MINLP
- The cluster problem in multivariate global optimization
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Convergence rate of McCormick relaxations
- Computation and application of Taylor polynomials with interval remainder bounds
- Taylor forms -- use and limits.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Taylor Model Based Integration of ODEs
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Theoretical rate of convergence for interval inclusion functions
Cited In (15)
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Tighter McCormick relaxations through subgradient propagation
- Stable set-valued integration of nonlinear dynamic systems using affine set-parameterizations
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
- On tightness and anchoring of McCormick and other relaxations
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Sensitivity analysis of uncertain dynamic systems using set-valued integration
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
- The cluster problem in constrained global optimization
- Chebyshev model arithmetic for factorable functions
- Towards rigorous robust optimal control via generalized high-order moment expansion
- Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs
- Global optimization in Hilbert space
- Convergence analysis of multivariate McCormick relaxations
Uses Software
This page was built for publication: Convergence analysis of Taylor models and McCormick-Taylor models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367158)
