The nearest point problem in a polyhedral set and its extensions

The nearest point problem in a polyhedral set and its extensions

0.00 Avg rating0 Votes
Article ID: iaor20125340
Volume: 53
Issue: 1
Start Page Number: 115
End Page Number: 130
Publication Date: Sep 2012
Journal: Computational Optimization and Applications
Authors: ,
Keywords: programming: convex
Abstract:

In this paper we investigate the relationship between the nearest point problem in a polyhedral cone and the nearest point problem in a polyhedral set, and use this relationship to devise an effective method for solving the latter using an existing algorithm for the former. We then show that this approach can be employed to minimize any strictly convex quadratic function over a polyhedral set. Through a computational experiment we evaluate the effectiveness of this approach and show that for a collection of randomly generated instances this approach is more effective than other existing methods for solving these problems.

Reviews

Required fields are marked *. Your email address will not be published.