<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>Convex Optimization by Radial Search</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">Y.M.</mods:namePart><mods:namePart type="family">Ermoliev</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">A.</mods:namePart><mods:namePart type="family">Ruszczynski</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>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.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1995-04</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>WP-95-036</mods:publisher></mods:originInfo><mods:genre>Monograph</mods:genre></mods:mods>