%A Y.M. Ermoliev
%A A. Ruszczynski
%T Convex Optimization by Radial Search
%X A convex nonsmooth optimization problem is replaced by a sequence of line search problems along recursively updated rays. Convergence of the method is proved and applications to linear inequalities, constraint aggregation and saddle point seeking  indicated.
%C IIASA, Laxenburg, Austria
%D 1995
%I WP-95-036
%L iiasa4556