Constrained Stress Majorization Using Diagonally Scaled Gradient Projection
نویسندگان
چکیده
Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly improve the speed and convergence properties of the constrained stress-majorization technique for graph layout by employing a diagonal scaling of the stress function. Diagonal scaling requires the active-set quadratic programming solver used in the projection step to be extended to handle separation constraints with scaled variables, i.e. of the form siyi + gij ≤ sjyj . The changes, although relatively small, are quite subtle and explained in detail.
منابع مشابه
Constrained graph layout by stress majorization and gradient projection
The adoption of the stress-majorization method from multi-dimensional scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we explore algorithms for augmenting such stress-majorization techniques with simple linear constraints using gradient-projection optimization techniques. O...
متن کاملInterior-Point Gradient Methods with Diagonal-Scalings for Simple-Bound Constrained Optimization
In this paper, we study diagonally scaled gradient methods for simple-bound constrained optimization in a framework almost identical to that for unconstrained optimization, except that iterates are kept within the interior of the feasible region. We establish a satisfactory global convergence theory for such interior-point gradient methods applied to Lipschitz continuously differentiable functi...
متن کاملBounded perturbation resilience of projected scaled gradient methods
We investigate projected scaled gradient (PSG) methods for convex minimization problems. These methods perform a descent step along a diagonally scaled gradient direction followed by a feasibility regaining step via orthogonal projection onto the constraint set. This constitutes a generalized algorithmic structure that encompasses as special cases the gradient projection method, the projected N...
متن کاملThe Supremum and Stability of Weighted Pseudoinverses
During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O'Leary obtained an upper bound for scaled pseudoinverses sup W2P k(W 1 2 X) + W 1 2 k 2 of a matrix X where P is a set of diagonal positive deenite matrices. We improved their results to obtain the ...
متن کاملEquivalent formulae for the supremum and stability of weighted pseudoinverses
During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O’Leary obtained an upper bound for scaled pseudoinverses sup W∈P ‖(W 12X)+W 2 ‖2 of a matrix X where P is a set of diagonal positive definite matrices. We improved their results to obtain the suprem...
متن کامل