Title of article
Principal majorization ideals and optimization
Author/Authors
Geir Dahl، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
18
From page
113
To page
130
Abstract
For a given vector let the principal majorization ideal M(b) be the set of vectors with nonincreasing coordinates that are majorized by b. M(b) is a polytope and we study the 1-skeleton and lattice properties of this set. Certain optimization problems involving M(b) are studied and a related class of matrices which contains the positive semidefinite matrices is investigated.
Keywords
Convexity , Partition lattices , Polytopes , majorization
Journal title
Linear Algebra and its Applications
Serial Year
2001
Journal title
Linear Algebra and its Applications
Record number
823284
Link To Document