| 书目名称 | Optimal Quadratic Programming Algorithms | | 副标题 | With Applications to | | 编辑 | Zdenek Dostál | | 视频video | | | 概述 | The first monograph to present the solution to quadratic programming problems, a topic usually addressed only in journal publications.Offers theoretical and practical results in the field of bound-con | | 丛书名称 | Springer Optimization and Its Applications | | 图书封面 |  | | 描述 | .Solving optimization problems in complex systems often requires the implementation of advanced mathematical techniques. Quadratic programming (QP) is one technique that allows for the optimization of a quadratic function in several variables in the presence of linear constraints. QP problems arise in fields as diverse as electrical engineering, agricultural planning, and optics. Given its broad applicability, a comprehensive understanding of quadratic programming is a valuable resource in nearly every scientific field...Optimal Quadratic Programming Algorithms. presents recently developed algorithms for solving large QP problems. The presentation focuses on algorithms which are, in a sense optimal, i.e., they can solve important classes of problems at a cost proportional to the number of unknowns. For each algorithm presented, the book details its classical predecessor, describes its drawbacks, introduces modifications that improve its performance, and demonstrates these improvements through numerical experiments...This self-contained monograph can serve as an introductory text on quadratic programming for graduate students and researchers. Additionally, since the solution of many | | 出版日期 | Book 2009 | | 关键词 | Algebra; SOIA; algorithm; algorithms; calculus; complex systems; electrical engineering; linear algebra; lin | | 版次 | 1 | | doi | https://doi.org/10.1007/b138610 | | isbn_softcover | 978-1-4419-4648-5 | | isbn_ebook | 978-0-387-84806-8Series ISSN 1931-6828 Series E-ISSN 1931-6836 | | issn_series | 1931-6828 | | copyright | Springer-Verlag US 2009 |
The information of publication is updating
|
|
发表于 2025-3-21 18:22:20
