How good are Global Newton methods? Part 1
Loading...
Authors
Goldstein, Allen
Subjects
Linear Programming
Computational Complexity
Linear programming
Computational complexity
Computational Complexity
Linear programming
Computational complexity
Advisors
Date of Issue
1989-02
Date
1989-02
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
Pt.1. 1) Relying on a theorem of Nemerovsky and Yuden(1979) a lower bound is given for the efficiency of global Newton methods over the class C1(mu, Lambda). 2) The efficiency of Smale's global Newton method in a simple setting with a nonsingular, Lipschitz-continuous Jacobian is considered. The efficiency is characterized by 2 parameters, the condition number Q and the smoothness S. The efficiency is sensitive to S, and insensitive to Q.
Type
Technical Report
Description
Series/Report No
Department
Identifiers
NPS Report Number
NPS-53-89-010
Sponsors
Naval Surface Weapons Center, Dahlgren, VA
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.