Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!nntp.sei.cmu.edu!news.cis.ohio-state.edu!math.ohio-state.edu!uwm.edu!vixen.cso.uiuc.edu!newsfeed.internetmci.com!news.sprintlink.net!new-news.sprintlink.net!news.interpath.net!sas!newshost.unx.sas.com!saswss
From: saswss@hotellng.unx.sas.com (Warren Sarle)
Subject: Re: Levenberg-Marquardt algorithm
Originator: saswss@hotellng.unx.sas.com
Sender: news@unx.sas.com (Noter of Newsworthy Events)
Message-ID: <DtpyKG.Dn0@unx.sas.com>
Date: Fri, 28 Jun 1996 16:45:52 GMT
X-Nntp-Posting-Host: hotellng.unx.sas.com
References:  <1996Jun24.100115.434@cathy.ijs.si>
Organization: SAS Institute Inc.
Lines: 16


In article <1996Jun24.100115.434@cathy.ijs.si>, robert.kocjancic@ijs.si (Robert Kocjancic, IJS) writes:
|> ... Otherwise, please point me to a place
|> where I can get ANY information about the L-M algorithm (articles etc.), 
|> possibly accessible through the net.

Aside from the numerous posts on L-M that have appeared over the past
couple weeks, there is "What are conjugate gradients,
Levenberg-Marquardt, etc.?" in ftp://ftp.sas.com/pub/neural/FAQ2.html


-- 

Warren S. Sarle       SAS Institute Inc.   The opinions expressed here
saswss@unx.sas.com    SAS Campus Drive     are mine and not necessarily
(919) 677-8000        Cary, NC 27513, USA  those of SAS Institute.
