Stopping rules and backward error analysis for bound-constrained optimization
نویسندگان
چکیده
منابع مشابه
Stopping rules and backward error analysis for bound-constrained optimization
Termination criteria for the iterative solution of bound-constrained optimization problems are examined in the light of backward error analysis. It is shown that the problem of determining a suitable perturbation on the problem’s data corresponding to the definition of the backward error is analytically solvable under mild assumptions. Moreover, a link between existing termination criteria and ...
متن کاملStopping rules for box-constrained stochastic global optimization
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second is based on the comparison of asymptotic expectation values of observable quantities to the actually measured ones. The third offers a probabilistic estimate for the number of local minima inside the search domain. Thei...
متن کاملUMIST In uence of Orthogonalityon the Backward Error andthe Stopping
Many algorithms for solving linear systems, least squares problems or eigen-problems need to compute an orthonormal basis. The computation is commonly performed using a QR factorization computed using the classical or the modiied Gram-Schmidt algorithm, the Householder algorithm, the Givens algorithm or the Gram-Schmidt algorithm with iterative reorthogonalization. For linear systems, it is wel...
متن کاملBackward Error Analysis for Numerical Integrators Backward Error Analysis for Numerical Integrators
We consider backward error analysis of numerical approximations to ordinary diie-rential equations, i.e., the numerical solution is formally interpreted as the exact solution of a modiied diierential equation. A simple recursive deenition of the modiied equation is stated. This recursion is used to give a new proof of the exponentially closeness of the numerical solutions and the solutions to a...
متن کاملBackward Error Bounds for Constrained Least Squares Problems ∗
We derive an upper bound on the normwise backward error of an approximate solution to the equality constrained least squares problem minBx=d ‖b − Ax‖2. Instead of minimizing over the four perturbations to A, b, B and d, we fix those to B and d and minimize over the remaining two; we obtain an explicit solution of this simplified minimization problem. Our experiments show that backward error bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2011
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-011-0376-1