Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by Tsinghua University Press, 2016
ISBN 10: 7302430705ISBN 13: 9787302430704
Seller: Opalick, Augusta, GA, U.S.A.
Book
Condition: Acceptable. Buy with confidence! Comes with our 100% money back guarantee!! Tracking included with every order!!! **** Access codes and supplements are not guaranteed with used items **** All items ship Monday - Friday in a secure bubble mailer . The cover is clean but does show some wear . The cover has curled corners . Cover is showing signs of some creases . The pages show normal wear . Page corners are curled .
Published by Tsinghua University Press, 2015
ISBN 10: 7302399565ISBN 13: 9787302399568
Seller: liu xing, Nanjing JiangSu, JS, China
Book
paperback. Condition: New. Language:Chinese.Paperback. Pub Date: 2015-10-01 Publisher: Tsinghua University Press three years ago. in October 2000. in order to systematically relevant reference for well-known foreign university textbooks. to promote international and reform of university curricula of university teaching process. planning Tsinghua University Press published the internationally renowned University of original teaching materials - disciplines of information technology and electrical engineering disciplines.
Published by Tsinghua University Press, 2016
ISBN 10: 7302430705ISBN 13: 9787302430704
Seller: liu xing, Nanjing JiangSu, JS, China
Book
paperback. Condition: New. Paperback. Pub Date: 2016-05-01 Pages: 564 Language: Chinese Publisher: Tsinghua University Press. Convex Optimization almost all mainstream convex optimization algorithms. It includes gradient. sub gradient method. polyhedron approximation method. neighbor method and the interior point method. These methods generally rely on the cost function and constraints of convexity (and not necessarily dependent on its differentiability). and direct or indirect contact with the duality. On the specific.