Solving balanced Procrustes problem with some constraints by eigenvalue decomposition
نویسندگان
چکیده
منابع مشابه
Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming
We present in this paper some results for solving the Quadratic Eigenvalue Complementarity Problem (QEiCP) by using DC(Difference of Convex functions) programming approaches. Two equivalent Nonconvex Polynomial Programming (NLP) formulations of QEiCP are introduced. We focus on the construction of the DC programming formulations of the QEiCP from these NLPs. The corresponding numerical solution...
متن کاملSolving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
The state-of-the-art algorithms for solving the trust-region subproblem are based on an iterative process, involving solutions of many linear systems, eigenvalue problems, subspace optimization, or line search steps. A relatively underappreciated fact, due to Gander, Golub and von Matt in 1989, is that trust-region subproblems can be solved by one generalized eigenvalue problem, with no outer i...
متن کاملSome results on the symmetric doubly stochastic inverse eigenvalue problem
The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$, to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$. If there exists an $ntimes n$ symmetric doubly stochastic ...
متن کاملSolving Stochastic Eigenvalue Problem of Wick Type
In this paper we study mathematically the eigenvalue problem for stochastic elliptic partial differential equation of Wick type. Using the Wick-product and the Wiener-Itô chaos expansion, the stochastic eigenvalue problem is reformulated as a system of an eigenvalue problem for a deterministic partial differential equation and elliptic partial differential equations by using the Fredholm altern...
متن کاملDecomposition patterns in problem solving
The paper develops a theory of biases in decision making. Discovering a strategy for solving a game is a complex problem that may be solved by decomposition; a player decomposing a problem into many simple subproblems may easily identify the optimal solution to each sub-problem: however it is shown that even though all partial solutions are optimal, the solution to the global problem may be lar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2010
ISSN: 0377-0427
DOI: 10.1016/j.cam.2009.11.036