Article View: bit.listserv.stat-l
Article #3521Finding saddle points
From: P.G.Hamer
Date: Mon, 10 Feb 1992 12:33
Date: Mon, 10 Feb 1992 12:33
6 lines
1031 bytes
1031 bytes
Are there any efficient ways to search for a saddle point? I am currently looking for the maximum of a minimum, but there must be a better way. Any pointers into the literature (or code) greatfully received. Thanks in advance, Peter
Technical Details
Message-ID:
<9202101232.2874@hazel.bnr.co.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!paladin.american.edu!auvm!BNR.CO.UK!P.G.HAMERReferences:
<9202070954.22228@hazel.bnr.co.uk>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: f5efb,2083b853b8811afe X-Google-Attributes: gidf5efb,public X-Google-ArrivalTime: 1992-02-10 04:51:07 PST Comments: Gated by NETNEWS@AUVM.AMERICAN.EDU Path: arc1-ca.pugleaf.net!sparky!uunet!paladin.american.edu!auvm!BNR.CO.UK!P.G.HAMER References: <9202070954.22228@hazel.bnr.co.uk> Organization: BNR Europe Limited, London Road, Harlow, Essex, UK Message-ID: <9202101232.2874@hazel.bnr.co.uk> Newsgroups: bit.listserv.stat-l Date: Mon, 10 Feb 1992 12:33:04 GMT Reply-To: Peter Hamer <P.G.Hamer@bnr.co.uk> Sender: "STATISTICAL CONSULTING" <STAT-L@MCGILL1.BITNET> From: P.G.Hamer@BNR.CO.UK Subject: Finding saddle points X-To: stat-l@vm1.mcgill.ca In-Reply-To: <9202070954.22228@hazel.bnr.co.uk>