A Superlinearly Convergent Algorithm for Min-Max Problems

Elijah Polak and D.Q. Mayne and J.E. Higgins

EECS Department, University of California, Berkeley

Technical Report No. UCB/ERL M86/103

1986

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/1986/Archive/ERL-86-103.pdf

BibTeX citation:

@techreport{Polak:M86/103,
    Author= {Polak, Elijah and Mayne, D.Q. and Higgins, J.E.},
    Title= {A Superlinearly Convergent Algorithm for Min-Max Problems},
    Year= {1986},
    Month= {Nov},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1986/800.html},
    Number= {UCB/ERL M86/103},
}

EndNote citation:

%0 Report
%A Polak, Elijah 
%A Mayne, D.Q. 
%A Higgins, J.E. 
%T A Superlinearly Convergent Algorithm for Min-Max Problems
%I EECS Department, University of California, Berkeley
%D 1986
%@ UCB/ERL M86/103
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1986/800.html
%F Polak:M86/103