An active index algorithm for the nearest point problem in a polyhedral cone

Authors:
Zhe Liu;Yahya Fathi
Affiliations:
Graduate Program in Operations Research, North Carolina State University, Raleigh, USA 27695;Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, USA 27695
Venue:
Computational Optimization and Applications
Year:
2011

Citing 4
Cited 1

A successive projection method

Mathematical Programming: Series A and B
Interior path following primal-dual algorithms. Part II: Convex quadratic programming

Mathematical Programming: Series A and B
An OL(n3) primal interior point algorithm for convex quadratic programming

Mathematical Programming: Series A and B
A modified projection algorithm for large strictly-convex quadratic programs

Journal of Optimization Theory and Applications

The nearest point problem in a polyhedral set and its extensions

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding the nearest point in a polyhedral cone C={x驴R n :D x驴0} to a given point b驴R n , where D驴R m脳n . This problem can be formulated as a convex quadratic programming problem with special structure. We study the structure of this problem and its relationship with the nearest point problem in a pos cone through the concept of polar cones. We then use this relationship to design an efficient algorithm for solving the problem, and carry out computational experiments to evaluate its effectiveness. Our computational results show that our proposed algorithm is more efficient than other existing algorithms for solving this problem.