Linear Inequality Scaling Problems
Copyright policy )Linear Inequality Scaling Problems
The author shows that the linear inequality scaling problems (LISP) is a generalization of the linear equality scaling problem and that it unifies a number of matrix-scaling problems that have been studied recently. Further, it is shown that LISP can be reduced to one of two convex optimization problems and these reductions are used to characterize solutions to LISP and to derive necessary and sufficient conditions for their existence. In addition, uniqueness of solutions is established and perturbed relaxations of LISP are considered.
Convex programming, Applications of mathematical programming, Linear inequalities of matrices, linear inequality scaling problems, reductions, linear equality scaling problem, Conditioning of matrices, matrix-scaling
Convex programming, Applications of mathematical programming, Linear inequalities of matrices, linear inequality scaling problems, reductions, linear equality scaling problem, Conditioning of matrices, matrix-scaling
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!