Optimization of Polynomials in Non-Commuting Variables (Paperback, 1st ed. 2016)

, ,
This book presents recent results on positivity and optimization of polynomials in non-commuting variables. Researchers in non-commutative algebraic geometry, control theory, system engineering, optimization, quantum physics and information science will find the unified notation and mixture of algebraic geometry and mathematical programming useful. Theoretical results are matched with algorithmic considerations; several examples and information on how to use NCSOStools open source package to obtain the results provided. Results are presented on detecting the eigenvalue and trace positivity of polynomials in non-commuting variables using Newton chip method and Newton cyclic chip method, relaxations for constrained and unconstrained optimization problems, semidefinite programming formulations of the relaxations and finite convergence of the hierarchies of these relaxations, and the practical efficiency of algorithms.

R1,872

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles18720
Mobicred@R175pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

This book presents recent results on positivity and optimization of polynomials in non-commuting variables. Researchers in non-commutative algebraic geometry, control theory, system engineering, optimization, quantum physics and information science will find the unified notation and mixture of algebraic geometry and mathematical programming useful. Theoretical results are matched with algorithmic considerations; several examples and information on how to use NCSOStools open source package to obtain the results provided. Results are presented on detecting the eigenvalue and trace positivity of polynomials in non-commuting variables using Newton chip method and Newton cyclic chip method, relaxations for constrained and unconstrained optimization problems, semidefinite programming formulations of the relaxations and finite convergence of the hierarchies of these relaxations, and the practical efficiency of algorithms.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer International Publishing AG

Country of origin

Switzerland

Series

SpringerBriefs in Mathematics

Release date

July 2016

Availability

Expected to ship within 10 - 15 working days

First published

2016

Authors

, ,

Dimensions

235 x 155 x 7mm (L x W x T)

Format

Paperback

Pages

104

Edition

1st ed. 2016

ISBN-13

978-3-319-33336-6

Barcode

9783319333366

Categories

LSN

3-319-33336-4



Trending On Loot