没有合适的资源?快使用搜索试试~ 我知道了~
Numerical Optimazation 2nd Edition Nocedal-Wright 英文原版
需积分: 9 12 下载量 80 浏览量
2018-12-09
14:22:18
上传
评论
收藏 4.18MB PDF 举报
温馨提示
试读
683页
该PDF为Numerical Optimazation 第二版英文原版,作者 J.Nocedal 和 S.J. Wright
资源推荐
资源详情
资源评论
This is page iii
Printer: Opaque this
Jorge Nocedal Stephen J. Wright
Numerical Optimization
Second Edition
This is pa
g
Printer: O
Jorge Nocedal Stephen J. Wright
EECS Department Computer Sciences Department
Northwestern University University of Wisconsin
Evanston, IL 60208-3118 1210 West Dayton Street
USA Madison, WI 53706–1613
nocedal@eecs.northwestern.edu USA
swright@cs.wisc.edu
Series Editors:
Thomas V. Mikosch
University of Copenhagen
Laboratory of Actuarial Mathematics
DK-1017 Copenhagen
Denmark
mikosch@act.ku.dk
Sidney I. Resnick
Cornell University
School of Operations Research and
Industrial Engineering
Ithaca, NY 14853
USA
sirl@cornell.edu
Stephen M. Robinson
Department of Industrial and Systems
Engineering
University of Wisconsin
1513 University Avenue
Madison, WI 53706–1539
USA
smrobins@facstaff.wise.edu
Mathematics Subject Classification (2000): 90B30, 90C11, 90-01, 90-02
Library of Congress Control Number: 2006923897
ISBN-10: 0-387-30303-0 ISBN-13: 978-0387-30303-1
Printed on acid-free paper.
C
2006 Springer Science+Business Media, LLC.
All rights reserved. This work may not be translated or copied in whole or in part without the written permission
of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for
brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now
known or hereafter developed is forbidden.
The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not
identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary
rights.
Printed in the United States of America. (TB/HAM)
987654321
springer.com
This is page v
Printer: Opaque this
To Sue, Isabel and Martin
and
To Mum and Dad
This is page vii
Printer: Opaque this
Contents
Preface xvii
Preface to the Second Edition xxi
1 Introduction 1
MathematicalFormulation ........................ 2
Example:ATransportationProblem ................... 4
ContinuousversusDiscreteOptimization................. 5
ConstrainedandUnconstrainedOptimization .............. 6
GlobalandLocalOptimization ...................... 6
Stochastic and Deterministic Optimization . . .............. 7
Convexity ................................. 7
Optimization Algorithms . ........................ 8
NotesandReferences ............................... 9
2 Fundamentals of Unconstrained Optimization 10
2.1 WhatIsaSolution? ............................ 12
viii C ONTENTS
Recognizing a Local Minimum ...................... 14
NonsmoothProblems ........................... 17
2.2 Overview of Algorithms .......................... 18
TwoStrategies:LineSearchandTrustRegion............... 19
SearchDirectionsforLineSearchMethods ................ 20
Models for Trust-Region Methods . . . .................. 25
Scaling................................... 26
Exercises...................................... 27
3 Line Search Methods 30
3.1 StepLength ................................ 31
The Wolfe Conditions ........................... 33
The Goldstein Conditions . . ....................... 36
Sufficient Decrease and Backtracking . .................. 37
3.2 ConvergenceofLineSearchMethods ................... 37
3.3 RateofConvergence............................ 41
ConvergenceRateofSteepestDescent................... 42
Newton’sMethod ............................. 44
Quasi-NewtonMethods.......................... 46
3.4 Newton’s Method with Hessian Modification ............... 48
EigenvalueModification.......................... 49
Adding a Multiple of the Identity . . . .................. 51
Modified Cholesky Factorization ..................... 52
ModifiedSymmetricIndefiniteFactorization............... 54
3.5 Step-Length Selection Algorithms ..................... 56
Interpolation................................ 57
InitialStepLength............................. 59
A Line Search Algorithm for the Wolfe Conditions . . . ......... 60
NotesandReferences ............................... 62
Exercises...................................... 63
4 Trust-Region Methods 66
Outline of the Trust-Region Approach .................. 68
4.1 Algorithms Based on the Cauchy Point .................. 71
TheCauchyPoint ............................. 71
ImprovingontheCauchyPoint...................... 73
TheDoglegMethod ............................ 73
Two-Dimensional Subspace Minimization . . .............. 76
4.2 GlobalConvergence ............................ 77
ReductionObtainedbytheCauchyPoint................. 77
ConvergencetoStationaryPoints ..................... 79
4.3 IterativeSolutionoftheSubproblem ................... 83
剩余682页未读,继续阅读
资源评论
glensjh
- 粉丝: 0
- 资源: 2
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功