A note on Smale's Global Newton method
Authors
Goldstein, Allen A.
Subjects
Global Newton methods
unconstrained optimization,computational complexity
Global newton methods
Unconstrained optimization
Computational complexity
unconstrained optimization,computational complexity
Global newton methods
Unconstrained optimization
Computational complexity
Advisors
Date of Issue
1989-08
Date
1989-08
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
We present an implementation of Smale's Global Newton method in a simple setting. The iteration count for the algorithm is sensitive only to the quantity 3o defined below.
Type
Technical Report
Description
Series/Report No
Department
Organization
Graduate School of Operational and Information Sciences (GSOIS)
Identifiers
NPS Report Number
NPS-53-89-016
Sponsors
Naval Postgraduate School, Monterey, CA
Funder
O&MN Direct Funding
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.