A critical index algorithm for nearest point problems on simplicial cones

DOI10.1007/BF01583789zbMath0479.90077OpenAlexW2160352162MaRDI QIDQ3937160

Yahya Fathi, Katta G. Murty

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01583789

zbMATH Keywords

linear complementarity problemdimension reductioncomputational experienceorthogonal projectionpositive definite symmetric matrixsimplicial conescritical index algorithmnearest point problems

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (12)

Fundamentals of cone regression ⋮ Error bounds for solutions of linear equations and inequalities ⋮ An algorithm for projecting onto simplicial cones ⋮ Exterior point algorithms for nearest points and convex quadratic programs ⋮ A gravitational interior point method for LP. ⋮ The nearest point problem in a polyhedral set and its extensions ⋮ An active index algorithm for the nearest point problem in a polyhedral cone ⋮ The steepest descent gravitational method for linear programming ⋮ A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming ⋮ Projection onto simplicial cones by a semi-smooth Newton method ⋮ Projection onto simplicial cones by Picard's method ⋮ CP-rays in simplicial cones

Cites Work

• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
• Finding the nearest point in A polytope
• Methods for Modifying Matrix Factorizations
• Unnamed Item

This page was built for publication: A critical index algorithm for nearest point problems on simplicial cones