eprintid: 4556
rev_number: 23
eprint_status: archive
userid: 351
dir: disk0/00/00/45/56
datestamp: 2016-01-15 02:06:17
lastmod: 2021-08-27 17:15:20
status_changed: 2016-01-15 02:06:17
type: monograph
metadata_visibility: show
item_issues_count: 3
creators_name: Ermoliev, Y.M.
creators_name: Ruszczynski, A.
creators_id: 1445
creators_id: 1475
title: Convex Optimization by Radial Search
ispublished: pub
internal_subjects: iis_met
internal_subjects: iis_sys
divisions: prog_opt
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.
date: 1995-04
date_type: published
publisher: WP-95-036
iiasapubid: WP-95-036
price: 10
creators_browse_id: 338
creators_browse_id: 1544
full_text_status: public
monograph_type: working_paper
place_of_pub: IIASA, Laxenburg, Austria
pages: 10
coversheets_dirty: FALSE
fp7_type: info:eu-repo/semantics/book
citation:   Ermoliev, Y.M. <https://pure.iiasa.ac.at/view/iiasa/338.html> & Ruszczynski, A. <https://pure.iiasa.ac.at/view/iiasa/1544.html>  (1995).  Convex Optimization by Radial Search.   IIASA Working Paper. IIASA, Laxenburg, Austria: WP-95-036     
document_url: https://pure.iiasa.ac.at/id/eprint/4556/1/WP-95-036.pdf