Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
From MaRDI portal
Publication:3423591
DOI10.1080/10556780500130525zbMATH Open1112.90080OpenAlexW2099299739MaRDI QIDQ3423591FDOQ3423591
Authors: Ralph Baker Kearfott 
Publication date: 14 February 2007
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500130525
Recommendations
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- A reliable affine relaxation method for global optimization
- scientific article; zbMATH DE number 869737
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
Cites Work
- Rigorous global search: continuous problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
Cited In (10)
- Validated constraints solving --- practicalities, pitfalls, and new developments
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Validated Linear Relaxations and Preprocessing: Some Experiments
- A reliable affine relaxation method for global optimization
- An efficient and safe framework for solving optimization problems
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- On smooth reformulations and direct non-smooth computations for minimax problems
Uses Software
This page was built for publication: Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423591)
