A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones

DOI10.1287/IJOC.6.3.292MaRDI QIDQ4698235zbMATHOpenAlexFDO

Authors Khaled S. Al-Sultan

Publication date 14 May 1995

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.6.3.292

zbMATH Keywords

Euclidean distanceinterior point algorithmconvex polyhedral conePos cones

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• Clipping algorithms for solving the nearest point problem over reduced convex hulls
• An improved algorithm for approximating the radii of point sets
• An active index algorithm for the nearest point problem in a polyhedral cone
• A new projection method for finding the closest point in the intersection of convex sets
• An algorithm for solving the nearest point problem in an affine subspace
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
• A new non-interior point algorithm for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• The nearest point problem in a polyhedral set and its extensions

Cited in

(3)

• Exterior point algorithms for nearest points and convex quadratic programs
• scientific article; zbMATH DE number 446508 (Why is no real title available?)
• An active index algorithm for the nearest point problem in a polyhedral cone

This page was built for publication: A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones

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