Accelerating two projection methods via perturbations with application to Intensity-Modulated Radiation Therapy

Constrained convex optimization problems arise naturally in many real-world applications. One strategy to solve them in an approximate way is to translate them into a sequence of convex feasibility problems via the recently developed level set scheme and then solve each feasibility problem using projection methods. However, if the problem is ill-conditioned, projection methods often show zigzagging behavior and therefore converge slowly. To address this issue, we exploit the bounded perturbation resilience of the projection methods and introduce two new perturbations which avoid zigzagging behavior. The first perturbation is in the spirit of $k$-step methods and uses gradient information from previous iterates. The second uses the approach of surrogate constraint methods combined with relaxed, averaged projections. We apply two different projection methods in the unperturbed version, as well as the two perturbed versions, to linear feasibility problems along with nonlinear optimization problems arising from intensity-modulated radiation therapy (IMRT) treatment planning. We demonstrate that for all the considered problems the perturbations can significantly accelerate the convergence of the projection methods and hence the overall procedure of the level set scheme. For the IMRT optimization problems the perturbed projection methods found an approximate solution up to 4 times faster than the unperturbed methods while at the same time achieving objective function values which were 0.5 to 5.1% lower.Comment: Accepted for publication in Applied Mathematics & Optimizatio

Quantum mechanical study of molecules - Eigenvalues and eigenvectors of real symmetric matrices

Computer methods for calculating eigenvalue and eigenvectors of real symmetric matrices arising in problems of molecular quantum mechanic

Gaudin Models and Bending Flows: a Geometrical Point of View

In this paper we discuss the bihamiltonian formulation of the (rational XXX) Gaudin models of spin-spin interaction, generalized to the case of sl(r)-valued spins. In particular, we focus on the homogeneous models. We find a pencil of Poisson brackets that recursively define a complete set of integrals of the motion, alternative to the set of integrals associated with the 'standard' Lax representation of the Gaudin model. These integrals, in the case of su(2), coincide wih the Hamiltonians of the 'bending flows' in the moduli space of polygons in Euclidean space introduced by Kapovich and Millson. We finally address the problem of separability of these flows and explicitly find separation coordinates and separation relations for the r=2 case.Comment: 27 pages, LaTeX with amsmath and amssym

Computational linear algebra over finite fields

We present here algorithms for efficient computation of linear algebra problems over finite fields