function minimization

Article View: sci.math.num-analysis

Article #931

Back to sci.math.num-analysis Previous Next

#931

From: Kwok Tin Yau
Date: Wed, 16 Dec 1992 15:35

14 lines
1022 bytes

Hi,
    In function minimization problems using gradient descent
method (with/without derivative information), is there any
relation between the rate of convergence and the dimension of
the problem in general?  Can anyone suggest any references at
the pros and cons of using gradient descent method in minimization
problems?

    Thanks a lot.

---
James Kwok                       |   The Hong Kong University of     |
Internet: jamesk@uxmail.ust.hk   |     Science and Technology        |
                                 |  Department of Computer Science   |

Technical Details

Message-ID: <1992Dec16.153534.6441@uxmail.ust.hk>

Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!sdd.hp.com!saimiri.primate.wisc.edu!hp9000.csc.cuhk.hk!uxmail!cssu3!jamesk

Show Full Headers

Complete Article Headers

Newsgroups: sci.math.num-analysis
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!sdd.hp.com!saimiri.primate.wisc.edu!hp9000.csc.cuhk.hk!uxmail!cssu3!jamesk
From: jamesk@ust.hk (Kwok Tin Yau)
Subject: function minimization
Message-ID: <1992Dec16.153534.6441@uxmail.ust.hk>
Sender: usenet@uxmail.ust.hk (usenet account)
Reply-To: jamesk@ust.hk
Organization: Hong Kong University of Science and Technology
Date: Wed, 16 Dec 1992 15:35:34 GMT
Lines: 15