A critical index algorithm for nearest point problems on simplicial cones

DOI10.1007/BF01583789MaRDI QIDQ3937160zbMATH OpenOpenAlexFDO

Authors 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

computational experiencecritical index algorithmdimension reductionlinear complementarity problemnearest point problemsorthogonal projectionpositive definite symmetric matrixsimplicial cones

Mathematics Subject Classification ID

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

Cites work

• A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
• Finding the nearest point in A polytope
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• Methods for Modifying Matrix Factorizations
• On the number of solutions to the complementarity problem and spanning properties of complementary cones

Cited in

(12)

• Projection onto simplicial cones by a semi-smooth Newton method
• Projection onto simplicial cones by Picard's method
• A gravitational interior point method for LP.
• Fundamentals of cone regression
• Error bounds for solutions of linear equations and inequalities
• An algorithm for projecting onto simplicial cones
• 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
• Exterior point algorithms for nearest points and convex quadratic programs
• The nearest point problem in a polyhedral set and its extensions
• CP-rays in simplicial cones

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3937160)