A critical index algorithm for nearest point problems on simplicial cones
Copyright policy )A critical index algorithm for nearest point problems on simplicial cones
We consider the linear complementarity problem (q, M) in which M is a positive definite symmetric matrix of order n. This problem is equivalent to a nearest point problem [/'; b] in which F = {A4, ..., A~} is a basis for R", b is a given point in R'; and it is required to find the nearest point in the simplicial cone Pos(F) to b. We develop an algorithm for solving the linear complementarity problem (q,M) or the equivalent nearest point problem [Y;b]. Computational experience in comparison with an existing algorithm is presented.
- University of Michigan–Flint United States
- University of Michigan United States
- University of Michigan–Ann Arbor United States
- Georgia Institute of Technology United States
Optimization, dimension reduction, Science, Critical Index, Orthogonal Projection, Simplicial Cone, Mathematical Methods in Physics, critical index algorithm, nearest point problems, computational experience, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), Numerical Analysis, positive definite symmetric matrix, Numerical and Computational Methods, orthogonal projection, Nearest Point, simplicial cones, Dimension Reduction, linear complementarity problem, Calculus of Variations and Optimal Control, Combinatorics, Mathematical and Computational Physics, Mathematics of Computing, Linear Complementarity Problem, Operation Research/Decision Theory, Mathematics
Optimization, dimension reduction, Science, Critical Index, Orthogonal Projection, Simplicial Cone, Mathematical Methods in Physics, critical index algorithm, nearest point problems, computational experience, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), Numerical Analysis, positive definite symmetric matrix, Numerical and Computational Methods, orthogonal projection, Nearest Point, simplicial cones, Dimension Reduction, linear complementarity problem, Calculus of Variations and Optimal Control, Combinatorics, Mathematical and Computational Physics, Mathematics of Computing, Linear Complementarity Problem, Operation Research/Decision Theory, Mathematics
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).15 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).Top 10% 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!