Marielba Rojas

Learn More
We present a new method for the large-scale trust-region subproblem. The method is matrix-free in the sense that only matrix-vector products are required. We recast the trust-region subproblem as a parameterized eigenvalue problem and compute an optimal value for the parameter. We then find the solution of the trust-region subproblem from the eigenvectors(More)
We consider large-scale least squares problems where the coefficient matrix comes from the discretization of an operator in an ill-posed problem, and the right-hand side contains noise. Special techniques known as regularization methods are needed to treat these problems in order to control the effect of the noise on the solution. We pose the regularization(More)
We present a new method for large-scale nonnegative regularization, based on a quadratically and nonnegatively constrained quadratic problem. Such problems arise for example in the regularization of ill-posed problems in image restoration where, in addition, some of the matrices involved are very ill-conditioned. The method is an interior-point iteration(More)
A MATLAB 6.0 implementation of the LSTRS method is presented. LSTRS was described in Rojas et al. [2000]. LSTRS is designed for large-scale quadratic problems with one norm constraint. The method is based on a reformulation of the trust-region subproblem as a parameterized eigenvalue problem, and consists of an iterative procedure that finds the(More)
We present a matrix{free algorithm for the large{scale trust{region sub-problem. Our algorithm relies on matrix{vector products only and does not require matrix factorizations. We recast the trust{region subproblem as a parameterized eigenvalue problem and compute an optimal value for the parameter. We then nd the optimal solution of the trust{region(More)
The minimization of linear functionals defined on the solutions of discrete ill-posed problems arises, e.g., in the computation of confidence intervals for these solutions. In 1990, Eldén proposed an algorithm for this minimization problem based on a parametric programming reformulation involving the solution of a sequence of trust-region problems, and(More)
We present a matrix{free algorithm for the large{scale trust{region sub-problem. Our algorithm relies on matrix{vector products only and does not require matrix factorizations. We recast the trust{region subproblem as a parameterized eigenvalue problem and compute an optimal value for the parameter. We then nd the optimal solution of the trust{region(More)
In a recent paper [Rojas, Santos, Sorensen: ACM ToMS 34 (2008), Article 11] an efficient method for solving the Large-Scale Trust-Region Subproblem was suggested which is based on recasting it in terms of a parameter dependent eigenvalue problem and adjusting the parameter iteratively. The essential work at each iteration is the solution of an eigenvalue(More)
The problem min x ‖x‖, s.t. ‖b−Ax‖ ≤ arises in the regularization of discrete forms of ill-posed problems when an estimate of the noise level in the data is available. After deriving necessary and sufficient optimality conditions for this problem, we propose two different classes of algorithms: a factorization-based algorithm for small to medium problems,(More)