Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
From MaRDI portal
Publication:3423591
DOI10.1080/10556780500130525zbMath1112.90080OpenAlexW2099299739MaRDI QIDQ3423591
Publication date: 14 February 2007
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500130525
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, An efficient and safe framework for solving optimization problems, A review of computation of mathematically rigorous bounds on optima of linear programs, On smooth reformulations and direct non-smooth computations for minimax problems, A reliable affine relaxation method for global optimization, Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs, Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces, Validated constraints solving --- practicalities, pitfalls, and new developments
Uses Software
Cites Work
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- Rigorous global search: continuous problems
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
