A model problem for global optimization
スポンサーリンク
概要
- 論文の詳細を見る
We present a model problem for global optimization in a specified number of unknowns. We give constraint and unconstraint formulations. The problem arose from structured condition numbers for linear systems of equations with Toeplitz matrix. We present a simple algorithm using additional information on the problem to find local minimizers which presumably are global. Without this it seems quite hard to find the global minimum numerically. For dimensions up to n=18 rigorous lower bounds for the problem are presented.
著者
関連論文
- 行列式の精度保証付き数値計算法
- 大規模疎行列の正定値性の保証法 (計算科学の基盤技術としての高速アルゴリズムとその周辺)
- On the generation of very ill-conditioned integer matrices
- A model problem for global optimization
- Iterative Refinement for Ill-Conditioned Linear Systems
- Adaptive and Efficient Algorithm for 2D Orientation Problem
- Inversion of Extremely Ill-Conditioned Matrices in Floating-Point
- Fast high precision summation
- Verified computation of a disc containing exactly k roots of a univariate nonlinear function