RT Monograph
SR 00
A1 Ermoliev, Y.M.
A1 Ruszczynski, A.
T1 Convex Optimization by Radial Search
YR 1995
FD 1995-04
SP 10
AB 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.
PB WP-95-036
PP IIASA, Laxenburg, Austria
AV Published
LK https://pure.iiasa.ac.at/id/eprint/4556/