?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=https%3A%2F%2Fpure.iiasa.ac.at%2Fid%2Feprint%2F4556%2F&rft.title=Convex+Optimization+by+Radial+Search&rft.creator=Ermoliev%2C+Y.M.&rft.creator=Ruszczynski%2C+A.&rft.description=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%2C+constraint+aggregation+and+saddle+point+seeking++indicated.&rft.publisher=WP-95-036&rft.date=1995-04&rft.type=Monograph&rft.type=NonPeerReviewed&rft.format=text&rft.language=en&rft.identifier=https%3A%2F%2Fpure.iiasa.ac.at%2Fid%2Feprint%2F4556%2F1%2FWP-95-036.pdf&rft.identifier=++Ermoliev%2C+Y.M.+%3Chttps%3A%2F%2Fpure.iiasa.ac.at%2Fview%2Fiiasa%2F338.html%3E+%26+Ruszczynski%2C+A.+%3Chttps%3A%2F%2Fpure.iiasa.ac.at%2Fview%2Fiiasa%2F1544.html%3E++(1995).++Convex+Optimization+by+Radial+Search.+++IIASA+Working+Paper.+IIASA%2C+Laxenburg%2C+Austria%3A+WP-95-036+++++