skip to content
A gradient method for approximating saddle points and constrained maxima Preview this item
ClosePreview this item
Checking...

A gradient method for approximating saddle points and constrained maxima

Author: Kenneth J Arrow; Leonid Hurwicz
Publisher: Santa Monica, Calif. : Rand Corp., 1951.
Series: P (Rand Corporation), P-223.
Edition/Format:   Print book : English
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Kenneth J Arrow; Leonid Hurwicz
OCLC Number: 38541897
Notes: "P-223."
Description: 15 leaves ; 28 cm
Series Title: P (Rand Corporation), P-223.
Responsibility: Kenneth J. Arrow and Leonid Hurwicz.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/38541897> # A gradient method for approximating saddle points and constrained maxima
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "38541897" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/42481858#Place/santa_monica_calif> ; # Santa Monica, Calif.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
   schema:about <http://id.worldcat.org/fast/1018630> ; # Method of steepest descent (Numerical analysis)
   schema:about <http://id.worldcat.org/fast/1012616> ; # Maxima and minima
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/42481858#Person/hurwicz_leonid> ; # Leonid Hurwicz
   schema:creator <http://viaf.org/viaf/97632349> ; # Kenneth Joseph Arrow
   schema:datePublished "1951" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/42481858> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/42481858#Series/p_rand_corporation> ; # P (Rand Corporation) ;
   schema:name "A gradient method for approximating saddle points and constrained maxima"@en ;
   schema:productID "38541897" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/38541897#PublicationEvent/santa_monica_calif_rand_corp_1951> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/42481858#Agent/rand_corp> ; # Rand Corp.
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/38541897> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/42481858#Person/hurwicz_leonid> # Leonid Hurwicz
    a schema:Person ;
   schema:familyName "Hurwicz" ;
   schema:givenName "Leonid" ;
   schema:name "Leonid Hurwicz" ;
    .

<http://experiment.worldcat.org/entity/work/data/42481858#Place/santa_monica_calif> # Santa Monica, Calif.
    a schema:Place ;
   schema:name "Santa Monica, Calif." ;
    .

<http://experiment.worldcat.org/entity/work/data/42481858#Series/p_rand_corporation> # P (Rand Corporation) ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/38541897> ; # A gradient method for approximating saddle points and constrained maxima
   schema:name "P (Rand Corporation) ;" ;
    .

<http://id.worldcat.org/fast/1012616> # Maxima and minima
    a schema:Intangible ;
   schema:name "Maxima and minima"@en ;
    .

<http://id.worldcat.org/fast/1018630> # Method of steepest descent (Numerical analysis)
    a schema:Intangible ;
   schema:name "Method of steepest descent (Numerical analysis)"@en ;
    .

<http://viaf.org/viaf/97632349> # Kenneth Joseph Arrow
    a schema:Person ;
   schema:birthDate "1921" ;
   schema:deathDate "2017" ;
   schema:familyName "Arrow" ;
   schema:givenName "Kenneth Joseph" ;
   schema:givenName "Kenneth J." ;
   schema:name "Kenneth Joseph Arrow" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.