An algorithm for least distance programming

DOI10.1007/BF01933597zbMath0467.65025MaRDI QIDQ3920551

Sverre Storøy

Publication date: 1980

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

simple modificationleast distance programming problemFletcher's algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cites Work

• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
• Finding the nearest point in A polytope
• A stable method for solving certain constrained least squares problems
• A General Quadratic Programming Algorithm
• An algorithm for finding a vector in the intersection of open convex polyhedral cones

This page was built for publication: An algorithm for least distance programming