From: Damian Yerrick Newsgroups: comp.os.msdos.djgpp Subject: Re: Optimization problem Organization: Pin Eight Software Message-ID: References: X-Newsreader: Forte Agent 1.7/32.534 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Lines: 20 X-Trace: /Kkf2K2ORA1L+7Car06VTuZIZGjX8gPjxiV89WArJGuoH6F+7A8heT5AsQsw2rjxTiteoVQDx6Y8!ayO7QlRmcpVm3BYwyPnZqn/92/KeaaacrEJZnB+jCFJapxKX6MC2VIYZlxqpBKxsQSjzc+NnlA== X-Complaints-To: abuse AT gte DOT net X-Abuse-Info: Please be sure to forward a copy of ALL headers X-Abuse-Info: Otherwise we will be unable to process your complaint properly NNTP-Posting-Date: Thu, 13 Jan 2000 04:11:03 GMT Distribution: world Date: Thu, 13 Jan 2000 04:11:03 GMT To: djgpp AT delorie DOT com DJ-Gateway: from newsgroup comp.os.msdos.djgpp Reply-To: djgpp AT delorie DOT com Thomas Koenig wrote in message ... > >I'm deep into math and wonder if anybody has implemented the Newton Raphson >algorithm for minimization. I want to do multidimensional scaling; I have a >distance matrix between points and want to represent the points in a >lowdimensional space with the minimum of stress possible on the distance >matrix. Newton's method: for(i = 0; i < n_steps; i++) x -= f(x) / Df(x); where f(x) is the function to be set to zero (the derivative of the function to be minimized), and Df(x) is the derivative of f(x). -- Damian Yerrick http://yerricde.tripod.com/ View full sig at http://www.rose-hulman.edu/~yerricde/sig.html