Convex optimization by radial search

Y. M. Ermoliev, A. Ruszczyński

Research output: Contribution to journalArticlepeer-review


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 relations to existing methods are discussed.

Original languageEnglish (US)
Pages (from-to)731-738
Number of pages8
JournalJournal of Optimization Theory and Applications
Issue number3
StatePublished - Dec 1996
Externally publishedYes

ASJC Scopus subject areas

  • Control and Optimization
  • Management Science and Operations Research
  • Applied Mathematics


  • Aggregation
  • Nonsmooth optimization
  • Subgradient methods


Dive into the research topics of 'Convex optimization by radial search'. Together they form a unique fingerprint.

Cite this