A Family of Projected Descent Methods for Optimization Problems with Simple Bounds

A. Schwartz and Elijah Polak

EECS Department, University of California, Berkeley

Technical Report No. UCB/ERL M95/44

1995

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1995/Archive/ERL-95-44.pdf

BibTeX citation:

@techreport{Schwartz:M95/44,
    Author= {Schwartz, A. and Polak, Elijah},
    Title= {A Family of Projected Descent Methods for Optimization Problems with Simple Bounds},
    Year= {1995},
    Month= {Jun},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1995/2783.html},
    Number= {UCB/ERL M95/44},
}

EndNote citation:

%0 Report
%A Schwartz, A. 
%A Polak, Elijah 
%T A Family of Projected Descent Methods for Optimization Problems with Simple Bounds
%I EECS Department, University of California, Berkeley
%D 1995
%@ UCB/ERL M95/44
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1995/2783.html
%F Schwartz:M95/44