A procedure is described for minimizing a class of matrix trace functions. The procedure is a refinement of an earlier procedure for minimizing the class of matrix trace functions using majorization. It contains a recently proposed algorithm by Koschat and Swayne for weighted Procrustes rotation as a special case. A number of trial analyses demonstrate that the refined majorization procedure is more efficient than the earlier majorization-based procedure
A novel algorithm is developed for the problem of finding a low-rank correlation matrix nearest to a...
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...
A procedure is described for minimizing a class of matrix trace functions. The procedure is a refine...
A procedure is described for minimizing a class of matrix trace functions. The procedure is a refine...
A procedure is described for minimizing a class of matrix trace functions. The procedure is a refine...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
We propose a new majorization-minimization (MM) method for non-smooth and non-convex programs, which...
We introduce a new majorization order for classes (sets) of matrices which generalizes several exist...
For a large variety of discrete choice models (or contingency table models) efficientand stable maxi...
For a large variety of discrete choice models (or contingency table models) efficientand stable maxi...
A novel algorithm is developed for the problem of finding a low-rank correlation matrix nearest to a...
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...
A procedure is described for minimizing a class of matrix trace functions. The procedure is a refine...
A procedure is described for minimizing a class of matrix trace functions. The procedure is a refine...
A procedure is described for minimizing a class of matrix trace functions. The procedure is a refine...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
The problem of minimizing a general matrix, trace function, possibly subject to certain constraints,...
We propose a new majorization-minimization (MM) method for non-smooth and non-convex programs, which...
We introduce a new majorization order for classes (sets) of matrices which generalizes several exist...
For a large variety of discrete choice models (or contingency table models) efficientand stable maxi...
For a large variety of discrete choice models (or contingency table models) efficientand stable maxi...
A novel algorithm is developed for the problem of finding a low-rank correlation matrix nearest to a...
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...