%0 Report
%9 IIASA Working Paper
%A Ermoliev, Y.M.
%A Ruszczynski, A.
%C IIASA, Laxenburg, Austria
%D 1995
%F iiasa:4556
%T Convex Optimization by Radial Search
%U https://pure.iiasa.ac.at/id/eprint/4556/
%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.