Two approaches are knownfor solvinglarge-scaleunconstrained optimization problems?the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and the comparisons versus other conjugate gradient methods are given. The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods.

• 关于产品：
• ● 正版保障：本网站隶属于中国国际图书贸易集团公司，确保所有图书都是100%正版。
• ● 环保纸张：进口图书大多使用的都是环保轻型张，颜色偏黄，重量比较轻。
• ● 毛边版：即书翻页的地方，故意做成了参差不齐的样子，一般为精装版，更具收藏价值。
• 
  关于退换货：
• 由于预订产品的特殊性，采购订单正式发订后，买方不得无故取消全部或部分产品的订购。
• 由于进口图书的特殊性，发生以下情况的，请直接拒收货物，由快递返回：
• ● 外包装破损/发错货/少发货/图书外观破损/图书配件不全（例如：光盘等）
  并请在工作日通过电话400-008-1110联系我们。
• 签收后，如发生以下情况，请在签收后的5个工作日内联系客服办理退换货：
• ● 缺页/错页/错印/脱线
• 
  关于发货时间：
• 一般情况下：
• ●【现货】 下单后48小时内由北京（库房）发出快递。
• ●【预订】【预售】下单后国外发货，到货时间预计5-8周左右，店铺默认中通快递，如需顺丰快递邮费到付。
• ● 需要开具发票的客户，发货时间可能在上述基础上再延后1-2个工作日（紧急发票需求，请联系010-68433105/3213）；
• ● 如遇其他特殊原因，对发货时间有影响的，我们会第一时间在网站公告，敬请留意。
• 
  关于到货时间：
• 由于进口图书入境入库后，都是委托第三方快递发货，所以我们只能保证在规定时间内发出，但无法为您保证确切的到货时间。
• ● 主要城市一般2-4天
• ● 偏远地区一般4-7天
• 
  关于接听咨询电话的时间：
• 010-68433105/3213正常接听咨询电话的时间为：周一至周五上午8：30～下午5：00，周六、日及法定节假日休息，将无法接听来电，敬请谅解。
• 其它时间您也可以通过邮件联系我们：customer@readgo.cn,工作日会优先处理。
• 
  关于快递：
• ● 已付款订单：主要由中通、宅急送负责派送，订单进度查询请拨打010-68433105/3213。