function minimization

Thread View: sci.math.num-analysis

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Kwok Tin Yau Wed, 16 Dec 1992 15:35

#931

Author: 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   |

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads