Gram Spectrahedra. Lynn Chua UC Berkeley. joint work with Daniel Plaumann, Rainer Sinn, and Cynthia Vinzant
|
|
- Karen Boyd
- 5 years ago
- Views:
Transcription
1 Gram Spectrahedra Lynn Chua UC Berkeley joint work with Daniel Plaumann, Rainer Sinn, and Cynthia Vinzant SIAM Conference on Applied Algebraic Geometry 017 1/17
2 Gram Matrices and Sums of Squares Let P R n be polytope with vertices in Z n 0. Let m P be a vector of monomials whose exponent vectors are lattice points in P. Let f R[x 1,..., x n ] with Newton polytope Newt(f ) := convex hull of exponents of monomials in f A Gram matrix of f is a real symmetric N N matrix A Sym N, where N := m P, such that f = m t P Am P. Define G(f ) to be the set of all Gram matrices of f. /17
3 Gram Matrices and Sums of Squares Proposition f R[x 1,..., x n ] with Newt(f ) P is a sum of squares iff there is a positive semidefinite Gram matrix A Sym + N such that f = m t P Am P. The Gram spectrahedron of f is G + (f ) = {A Sym + N : mt P Am P = f }. The length of f is the shortest length of any SOS representation of f, or the minimum rank of any matrix in G + (f ). 3/17
4 Gram Spectrahedron Gram matrices are more unique representations than SOS. x + y = (cos(θ)x sin(θ)y) + (sin(θ)x + cos(θ)y) have the same Gram matrix for any θ [0, π]. Two SOS representations f = p p r = q q r are equivalent if they give the same Gram matrix orthogonal (r r)-matrix U such that (q 1,..., q r ) t = U (p 1,..., p r ) t. 4/17
5 Connections to Toric Geometry Theorem (Blekerman, Smith, Velasco, 013) Let P R n be a normal lattice polytope. Suppose every nonnegative f R[x 1,..., x n ] with Newton polytope P is a sum of squares. Then P is, up to translation and an automorphism of the lattice, contained in one of: 1. m 1 = conv{0, e 1,..., e m } R m. conv {([0, d 1 ] e 1 ) ([0, d ] e ) ([0, d m ] e m )} R R m, d i Z 0 3. conv{(0, 0), (, 0), (0, )} R 4. conv{(q {0}) ({0} n 1 )} R m R n, where Q is (1)-(3) and n 1 = conv{0, e 1,..., e n } 5/17
6 Ranks on spectrahedra Proposition (Pataki interval) Let L Sym N be an affine-linear space of dimension m. The rank r of an extreme point of L Sym + N satisfies ( r + 1 ) + m ( N + 1 Furthermore, if L is generic, ( ) N r + 1 m. Proposition For a general polynomial, the rank of all extreme points of its Gram spectrahedron lies in the Pataki interval. ). 6/17
7 Gram spectrahedra of binary forms Proposition Let f R[s, t] be a positive binary form of degree d with distinct roots. G(f ) contains 1 d ) ( d matrices of rank over C. Proof. Writing f as a sum of two squares partitions the roots into two size d subsets: f = p + q = (p + iq)(p iq). Two equivalent representations yield the same partition: f = (cos(θ)p + sin(θ)q) + (sin(θ)p cos(θ)q) = ( e iθ (p iq) ) (e iθ (p + iq) ) The number of such partitions is ( 1 d ) d. 7/17
8 Gram spectrahedra of binary forms Proposition The Gram spectrahedron G + (f ) contains d 1 real matrices of rank. If d is even, there are an additional 1 ( d d/) real indefinite matrices of rank in G(f ). Proof. For the partition of roots to be real, complex conjugation must either fix both blocks of d roots or swap them. If blocks are swapped: f = gg = (Re(g)) + (Im(g)). Each conjugate pair has one element per block, so there are d 1 partitions If blocks are fixed, d is even and there are 1 ( d d/) partitions. f = gh = 1 ((g + h) (g h) ), where g, h are positive. 8/17
9 Binary forms of degrees and 4 Let f = a s + a 1 st + a 0 t be nonnegative, then G + (f ) consists of ( ) 1 a a 1 1 a 1 a 0 If f has a zero, then f = l for the linear form vanishing at the root of f and its Gram matrix has rank 1. If f is strictly positive, then f is the sum of two squares (completing the square) and its Gram matrix has rank. If f is a positive binary form of degree 4, then G + (f ) contains matrices of rank. G + (f ) is a line segment, which is the convex hull of two sum-of-two-squares representations f = p 1 + q 1 = p + q 9/17
10 Binary sextics and Kummer surfaces f = a 6 s 6 6a 5 s 5 t+15a 4 s 4 t 0a 3 s 3 t 3 +15a s t 4 6a 1 st 5 +a 0 t 6 G + (f ) is the set of matrices in Sym + 4 of the form a 6 3a 5 3a 4 + z a 3 y 3a 5 9a 4 z 9a 3 + y 3a + x 3a 4 + z 9a 3 + y 9a x 3a 1 a 3 y 3a + x 3a 1 a 0 The determinant of this matrix is a Kummer surface.. 10/17
11 Kummer surface The Kummer surface is a quartic in P 3 with 16 nodes in a 16 6 configuration. 6 nodes (u i : u i : 1 : 0), where u 1,..., u 6 are the distinct complex roots of f (s, 1). These give rank-3 matrices. 10 nodes correspond to representations of f as a sum of two squares over C. These give rank- matrices. 11/17
12 Kummer surface The dual projective variety of a Kummer surface is again a Kummer surface: F = W F + WF 1 + F 0 F = Y + 4XZ F 1 = a 0 X 3 + 3a 1 X Y + 3a XY + a 3 Y 3 + 3a X Z + 6a 3 XYZ + 3a 4 Y Z + 3a 4 XZ + 3a 5 YZ + a 6 Z 3 F 0 = ( 9(a 0 a a 1)X (a 0 a 3 a 1 a )X 3 Y + 3(5a 0 a 4 a 1 a 3 3a )X Y + 6(a 0 a 5 a a 3 )XY 3 + (a 0 a 6 a 3)Y 4 + 6( a 0 a a 1 a 3 9a )X 3 Z + 6( a 0 a 5 + 1a 1 a 4 11a a 3 )X YZ + ( a 0 a a 1 a 5 9a a 4 8a 3)XY Z + 6(a 1 a 6 a 3 a 4 )Y 3 Z + 9(a 4 a 6 a 5)Z 4 + (a 0 a 6 18a 1 a a a 4 100a 3)X Z + 6( a 1 a 6 + 1a a 5 11a 3 a 4 )XYZ + 3(5a a 6 a 3 a 5 3a 4)Y Z + 6( a a a 3 a 5 9a 4)XZ (a 3 a 6 a 4 a 5 )YZ 3). 1/17
13 SDP over the Gram spectrahedron Proposition The algebraic degree of semidefinite programming over the Gram spectrahedron of a binary sextic is (10, ) in ranks (, 3). Proof. Given a cost vector c = (c 1, c, c 3 ) Q 3, the rank-3 critical points (x, y, z) satisfy c 1 x + c y + c 3 z = F 1(c) ± F 1 (c) 4 F 0 (c) F (c). F (c) and can be expressed over a quadratic field extension of Q. The optimal point is either one of these rank 3-matrices or one of the 10 rank- matrices. 13/17
14 Example f = s 6 s 5 t + 5s 4 t 4s 3 t 3 + 5s t 4 st 5 + t 6 The linear form x z on G + (f ) gives dual coordinates c = (X, Y, Z) = (1, 0, 1). The equation of the dual Kummer surface gives W = ± 5. The corresponding rank-3 Gram matrices over Q[ 5] are , /17
15 The Kummer surface and its dual Figure: The Kummer surface bounding G + (f ), dual Kummer surface, and dual convex body of G + (f ). Both the primal and dual Kummer surfaces have 4 real nodes, and we can compute a real linear transformation from one to the other. If the roots {u 1, u, u 3 } are conjugate to {u 4, u 5, u 6 }, then we can define a real transformation taking the node [0 : 0 : 0 : 1] on the dual surface to the rank- Gram matrix of f corresponding to the representation of f as gg where = (t u 1 )(t u )(t u 3 ). 15/17
16 Ternary Quartics Experimental evidence suggests that a general rational ternary quartic possesses a rational Gram matrix of rank 5. Question What is a formula for the hypersurface dual to the boundary of the Gram spectrahedron of a general ternary quartic? Can we derive an explicit formula analogous to the equation of the dual Kummer surface? 16/17
17 Thank you! Any Questions? 17/17
arxiv: v3 [math.ag] 2 May 2018
GRAM SPECTRAHEDRA LYNN CHUA, DANIEL PLAUMANN, RAINER SINN, AND CYNTHIA VINZANT arxiv:1608.0034v3 [math.ag] May 018 Abstract. Representations of nonnegative polynomials as sums of squares are central to
More informationQUARTIC SPECTRAHEDRA. Bernd Sturmfels UC Berkeley and MPI Bonn. Joint work with John Christian Ottem, Kristian Ranestad and Cynthia Vinzant
QUARTIC SPECTRAHEDRA Bernd Sturmfels UC Berkeley and MPI Bonn Joint work with John Christian Ottem, Kristian Ranestad and Cynthia Vinzant 1 / 20 Definition A spectrahedron of degree n in R 3 is a convex
More informationRanks of Real Symmetric Tensors
Ranks of Real Symmetric Tensors Greg Blekherman SIAM AG 2013 Algebraic Geometry of Tensor Decompositions Real Symmetric Tensor Decompositions Let f be a form of degree d in R[x 1,..., x n ]. We would like
More informationSPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley GAeL Lecture I on Convex Algebraic Geometry Coimbra, Portugal, Monday, June 7, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More informationSPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley Mathematics Colloquium, North Carolina State University February 5, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent:
More informationThe Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley
The Geometry of Semidefinite Programming Bernd Sturmfels UC Berkeley Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent: All n eigenvalues of A are positive real
More informationRepresentations of Positive Polynomials: Theory, Practice, and
Representations of Positive Polynomials: Theory, Practice, and Applications Dept. of Mathematics and Computer Science Emory University, Atlanta, GA Currently: National Science Foundation Temple University
More informationThe Pythagoras numbers of projective varieties.
The Pythagoras numbers of projective varieties. Grigoriy Blekherman (Georgia Tech, USA) Rainer Sinn (FU Berlin, Germany) Gregory G. Smith (Queen s University, Canada) Mauricio Velasco (Universidad de los
More informationCombinatorics and geometry of E 7
Combinatorics and geometry of E 7 Steven Sam University of California, Berkeley September 19, 2012 1/24 Outline Macdonald representations Vinberg representations Root system Weyl group 7 points in P 2
More informationSixty-Four Curves of Degree Six
Sixty-Four Curves of Degree Six Bernd Sturmfels MPI Leipzig and UC Berkeley with Nidhi Kaihnsa, Mario Kummer, Daniel Plaumann and Mahsa Sayyary 1 / 24 Poset 2 / 24 Hilbert s 16th Problem Classify all real
More informationPOSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) Contents
POSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) SALMA KUHLMANN Contents 1. Proof of Hilbert s Theorem (continued) 1 2. The Motzkin Form 2 3. Robinson Method (1970) 3 3. The Robinson Form 4 1. PROOF OF
More informationExact algorithms: from Semidefinite to Hyperbolic programming
Exact algorithms: from Semidefinite to Hyperbolic programming Simone Naldi and Daniel Plaumann PGMO Days 2017 Nov 14 2017 - EDF Lab Paris Saclay 1 Polyhedra P = {x R n : i, l i (x) 0} Finite # linear inequalities
More informationSPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic
SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic Didier Henrion Simone Naldi Mohab Safey El Din Version 1.0 of November 5, 2016 Abstract This document briefly describes
More informationHYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES
HYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES DANIEL PLAUMANN Universität Konstanz joint work with Mario Kummer (U. Konstanz) Cynthia Vinzant (U. of Michigan) Out[121]= POLYNOMIAL OPTIMISATION
More informationCONVEX ALGEBRAIC GEOMETRY. Bernd Sturmfels UC Berkeley
CONVEX ALGEBRAIC GEOMETRY Bernd Sturmfels UC Berkeley Multifocal Ellipses Given m points (u 1, v 1 ),...,(u m, v m )intheplaner 2,and aradiusd > 0, their m-ellipse is the convex algebraic curve { (x, y)
More informationALGEBRA: From Linear to Non-Linear. Bernd Sturmfels University of California at Berkeley
ALGEBRA: From Linear to Non-Linear Bernd Sturmfels University of California at Berkeley John von Neumann Lecture, SIAM Annual Meeting, Pittsburgh, July 13, 2010 Undergraduate Linear Algebra All undergraduate
More informationQuartic Spectrahedra
Quartic Spectrahedra arxiv:1311.3675v2 [math.oc] 7 Nov 2014 John Christian Ottem, Kristian Ranestad, Bernd Sturmfels and Cynthia Vinzant Abstract Quartic spectrahedra in 3-space form a semialgebraic set
More informationQuartic Spectrahedra
Quartic Spectrahedra arxiv:1311.3675v1 [math.oc] 14 Nov 2013 John Christian Ottem, Kristian Ranestad, Bernd Sturmfels and Cynthia Vinzant Abstract Quartic spectrahedra in 3-space form a semialgebraic set
More informationSymbolic computation in hyperbolic programming
Symbolic computation in hyperbolic programming Simone Naldi and Daniel Plaumann MEGA 2017 Nice, 14 June 2017 1 Polyhedra P = {x R n : i, l i (x) 0} Finite # linear inequalities : l i (x) 0, i = 1,...,
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationon Semialgebraic Sets for Nonnnegative Polynomials Finding Representations
Finding Representations for Nonnnegative Polynomials on Semialgebraic Sets Ruchira Datta Department of Mathematics University of California Berkeley, California April 2nd, 2002 1 Introducing Polynomial
More informationUnbounded Convex Semialgebraic Sets as Spectrahedral Shadows
Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Shaowei Lin 9 Dec 2010 Abstract Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the
More informationReal Algebraic Geometry in Convex Optimization. Cynthia Vinzant
Real Algebraic Geometry in Convex Optimization by Cynthia Vinzant A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate
More informationThe Algebraic Degree of Semidefinite Programming
The Algebraic Degree ofsemidefinite Programming p. The Algebraic Degree of Semidefinite Programming BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY joint work with and Jiawang Nie (IMA Minneapolis)
More informationRobust and Optimal Control, Spring 2015
Robust and Optimal Control, Spring 2015 Instructor: Prof. Masayuki Fujita (S5-303B) G. Sum of Squares (SOS) G.1 SOS Program: SOS/PSD and SDP G.2 Duality, valid ineqalities and Cone G.3 Feasibility/Optimization
More informationDEGREES PhD: Doktor der Naturwissenschaften (summa cum laude) May 2014; Advisor: Claus Scheiderer Diploma Degree in Mathematics (grade 1.
CURRENT STATUS Juniorprofessur Discrete Geometry at Freie Universität Berlin (working group of Günter Ziegler) Acting head of the working group Discrete Geometry at FU Berlin (since July 2018) PREVIOUS
More informationUrsula Whitcher May 2011
K3 Surfaces with S 4 Symmetry Ursula Whitcher ursula@math.hmc.edu Harvey Mudd College May 2011 Dagan Karp (HMC) Jacob Lewis (Universität Wien) Daniel Moore (HMC 11) Dmitri Skjorshammer (HMC 11) Ursula
More informationQR Decomposition. When solving an overdetermined system by projection (or a least squares solution) often the following method is used:
(In practice not Gram-Schmidt, but another process Householder Transformations are used.) QR Decomposition When solving an overdetermined system by projection (or a least squares solution) often the following
More informationGlobally convergent algorithms for PARAFAC with semi-definite programming
Globally convergent algorithms for PARAFAC with semi-definite programming Lek-Heng Lim 6th ERCIM Workshop on Matrix Computations and Statistics Copenhagen, Denmark April 1 3, 2005 Thanks: Vin de Silva,
More information6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC
6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 2003 2003.09.02.10 6. The Positivstellensatz Basic semialgebraic sets Semialgebraic sets Tarski-Seidenberg and quantifier elimination Feasibility
More informationarxiv: v2 [math.ag] 3 Dec 2016
DO SUMS OF SQUARES DREAM OF FREE RESOLUTIONS? GRIGORIY BLEKHERMAN, RAINER SINN, AND MAURICIO VELASCO arxiv:1607.03551v2 [math.ag] 3 Dec 2016 ABSTRACT. For a real projective variety X, the cone Σ X of sums
More information5.1 Monomials. Algebra 2
. Monomials Algebra Goal : A..: Add, subtract, multiply, and simplify polynomials and rational expressions (e.g., multiply (x ) ( x + ); simplify 9x x. x Goal : Write numbers in scientific notation. Scientific
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
More informationVoronoi Cells of Varieties
Voronoi Cells of Varieties arxiv:1811.08395v1 [math.ag] 20 Nov 2018 Diego Cifuentes, Kristian Ranestad, Bernd Sturmfels and Madeleine Weinstein Abstract Every real algebraic variety determines a Voronoi
More informationSomething that can have different values at different times. A variable is usually represented by a letter in algebraic expressions.
Lesson Objectives: Students will be able to define, recognize and use the following terms in the context of polynomials: o Constant o Variable o Monomial o Binomial o Trinomial o Polynomial o Numerical
More informationConvex Optimization & Parsimony of L p-balls representation
Convex Optimization & Parsimony of L p -balls representation LAAS-CNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials
More informationWhat can be expressed via Conic Quadratic and Semidefinite Programming?
What can be expressed via Conic Quadratic and Semidefinite Programming? A. Nemirovski Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Abstract Tremendous recent
More informationarxiv:math/ v1 [math.oc] 26 Mar 2001
DIMACS Series in Discrete Mathematics and Theoretical Computer Science arxiv:math/0103170v1 [math.oc] 26 Mar 2001 Minimizing Polynomial Functions Pablo A. Parrilo and Bernd Sturmfels Abstract. We compare
More informationPoint counting and real multiplication on K3 surfaces
Point counting and real multiplication on K3 surfaces Andreas-Stephan Elsenhans Universität Paderborn September 2016 Joint work with J. Jahnel. A.-S. Elsenhans (Universität Paderborn) K3 surfaces September
More informationSemidefinite Programming
Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i
More informationTrigonometric Polynomials and Quartic Hyperbolic Ternary Forms
International Journal of Algebra, Vol. 5, 2011, no. 4, 159-166 Trigonometric Polynomials and Quartic Hyperbolic Ternary Forms Seiji Kitamura Graduate School of Science and Technology Hirosaki University,
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationTORIC REDUCTION AND TROPICAL GEOMETRY A.
Mathematisches Institut, Seminars, (Y. Tschinkel, ed.), p. 109 115 Universität Göttingen, 2004-05 TORIC REDUCTION AND TROPICAL GEOMETRY A. Szenes ME Institute of Mathematics, Geometry Department, Egry
More informationThe partial-fractions method for counting solutions to integral linear systems
The partial-fractions method for counting solutions to integral linear systems Matthias Beck, MSRI www.msri.org/people/members/matthias/ arxiv: math.co/0309332 Vector partition functions A an (m d)-integral
More informationThe Graph Realization Problem
The Graph Realization Problem via Semi-Definite Programming A. Y. Alfakih alfakih@uwindsor.ca Mathematics and Statistics University of Windsor The Graph Realization Problem p.1/21 The Graph Realization
More informationHilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry
Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry Rekha R. Thomas University of Washington, Seattle References Monique Laurent, Sums of squares, moment matrices and optimization
More informationExact algorithms for linear matrix inequalities
0 / 12 Exact algorithms for linear matrix inequalities Mohab Safey El Din (UPMC/CNRS/IUF/INRIA PolSys Team) Joint work with Didier Henrion, CNRS LAAS (Toulouse) Simone Naldi, Technische Universität Dortmund
More informationarxiv: v1 [math.ag] 3 Aug 2013
SUMS OF SQUARES AND VARIETIES OF MINIMAL DEGREE arxiv:1308.0751v1 [math.ag] 3 Aug 2013 GRIGORIY BLEKHERMAN, GREGORY G. SMITH, AND MAURICIO VELASCO ABSTRACT. Let X P n be a real nondegenerate subvariety
More informationA new look at nonnegativity on closed sets
A new look at nonnegativity on closed sets LAAS-CNRS and Institute of Mathematics, Toulouse, France IPAM, UCLA September 2010 Positivstellensatze for semi-algebraic sets K R n from the knowledge of defining
More informationComplexity of Deciding Convexity in Polynomial Optimization
Complexity of Deciding Convexity in Polynomial Optimization Amir Ali Ahmadi Joint work with: Alex Olshevsky, Pablo A. Parrilo, and John N. Tsitsiklis Laboratory for Information and Decision Systems Massachusetts
More informationAbstract Algebra Study Sheet
Abstract Algebra Study Sheet This study sheet should serve as a guide to which sections of Artin will be most relevant to the final exam. When you study, you may find it productive to prioritize the definitions,
More informationReview for Mastery. Integer Exponents. Zero Exponents Negative Exponents Negative Exponents in the Denominator. Definition.
LESSON 6- Review for Mastery Integer Exponents Remember that means 8. The base is, the exponent is positive. Exponents can also be 0 or negative. Zero Exponents Negative Exponents Negative Exponents in
More informationON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th
More informationThe Q Method for Symmetric Cone Programmin
The Q Method for Symmetric Cone Programming The Q Method for Symmetric Cone Programmin Farid Alizadeh and Yu Xia alizadeh@rutcor.rutgers.edu, xiay@optlab.mcma Large Scale Nonlinear and Semidefinite Progra
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationarxiv: v1 [math.oc] 9 Sep 2015
CONTAINMENT PROBLEMS FOR PROJECTIONS OF POLYHEDRA AND SPECTRAHEDRA arxiv:1509.02735v1 [math.oc] 9 Sep 2015 KAI KELLNER Abstract. Spectrahedra are affine sections of the cone of positive semidefinite matrices
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationd A 0 + m t k A k 0 whenever λ min (B k (x)) t k λ max (B k (x)) for k = 1, 2,..., m x n B n (k).
MATRIX CUBES PARAMETERIZED BY EIGENVALUES JIAWANG NIE AND BERND STURMFELS Abstract. An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix
More informationForms as sums of powers of lower degree forms
Bruce Reznick University of Illinois at Urbana-Champaign SIAM Conference on Applied Algebraic Geometry Algebraic Geometry of Tensor Decompositions Fort Collins, Colorado August 2, 2013 Let H d (C n ) denote
More informationTHE ENVELOPE OF LINES MEETING A FIXED LINE AND TANGENT TO TWO SPHERES
6 September 2004 THE ENVELOPE OF LINES MEETING A FIXED LINE AND TANGENT TO TWO SPHERES Abstract. We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations
More informationComputing zeta functions of nondegenerate toric hypersurfaces
Computing zeta functions of nondegenerate toric hypersurfaces Edgar Costa (Dartmouth College) December 4th, 2017 Presented at Boston University Number Theory Seminar Joint work with David Harvey (UNSW)
More informationLecture 5. 1 Goermans-Williamson Algorithm for the maxcut problem
Math 280 Geometric and Algebraic Ideas in Optimization April 26, 2010 Lecture 5 Lecturer: Jesús A De Loera Scribe: Huy-Dung Han, Fabio Lapiccirella 1 Goermans-Williamson Algorithm for the maxcut problem
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms. Author(s)
More informationHomogeneous Coordinate Ring
Students: Kaiserslautern University Algebraic Group June 14, 2013 Outline Quotients in Algebraic Geometry 1 Quotients in Algebraic Geometry 2 3 4 Outline Quotients in Algebraic Geometry 1 Quotients in
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationLecture 26: April 22nd
10-725/36-725: Conve Optimization Spring 2015 Lecture 26: April 22nd Lecturer: Ryan Tibshirani Scribes: Eric Wong, Jerzy Wieczorek, Pengcheng Zhou Note: LaTeX template courtesy of UC Berkeley EECS dept.
More informationConvex algebraic geometry, optimization and applications
Convex algebraic geometry, optimization and applications The American Institute of Mathematics The following compilation of participant contributions is only intended as a lead-in to the AIM workshop Convex
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationSolving rank-constrained semidefinite programs in exact arithmetic
Solving rank-constrained semidefinite programs in exact arithmetic Simone Naldi Technische Universität Dortmund Fakultät für Mathematik Vogelpothsweg 87, 44227 Dortmund Abstract We consider the problem
More informationToric Ideals, Real Toric Varieties, and the Algebraic Moment Map
University of Massachusetts Amherst ScholarWorks@UMass Amherst Mathematics and Statistics Department Faculty Publication Series Mathematics and Statistics 2003 Toric Ideals, Real Toric Varieties, and the
More informationComputational Problems Using Riemann Theta Functions in Sage
Computational Problems Using Riemann Theta Functions in Sage Chris Swierczewski University of Washington Department of Applied Mathematics cswiercz@uw.edu 2011 AMS Western Fall Sectional Salt Lake City,
More informationMATH 433 Applied Algebra Lecture 22: Semigroups. Rings.
MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and
More informationTropical aspects of algebraic matroids. Jan Draisma Universität Bern and TU Eindhoven (w/ Rudi Pendavingh and Guus Bollen TU/e)
1 Tropical aspects of algebraic matroids Jan Draisma Universität Bern and TU Eindhoven (w/ Rudi Pendavingh and Guus Bollen TU/e) Two advertisements 2 SIAGA: SIAM AG 19: 9 13 July 2019, Bern Algebraic matroids
More information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
More informationreview To find the coefficient of all the terms in 15ab + 60bc 17ca: Coefficient of ab = 15 Coefficient of bc = 60 Coefficient of ca = -17
1. Revision Recall basic terms of algebraic expressions like Variable, Constant, Term, Coefficient, Polynomial etc. The coefficients of the terms in 4x 2 5xy + 6y 2 are Coefficient of 4x 2 is 4 Coefficient
More informationSEMIDEFINITE PROGRAM BASICS. Contents
SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 28 (Algebra + Optimization) 02 May, 2013 Suvrit Sra Admin Poster presentation on 10th May mandatory HW, Midterm, Quiz to be reweighted Project final report
More informationArithmetic applications of Prym varieties in low genus. Nils Bruin (Simon Fraser University), Tübingen, September 28, 2018
Arithmetic applications of Prym varieties in low genus Nils Bruin (Simon Fraser University), Tübingen, September 28, 2018 Background: classifying rational point sets of curves Typical arithmetic geometry
More information5. Duality. Lagrangian
5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More informationTogliatti systems and artinian ideals failing WLP. Weak Lefschetz Property
Togliatti systems and artinian ideals failing the Weak Lefschetz Property Dipartimento di Matematica e Geoscienze Università degli Studi di Trieste mezzette@units.it Lefschetz Properties and Artinian Algebras
More informationAffine Geometry and Discrete Legendre Transform
Affine Geometry and Discrete Legendre Transform Andrey Novoseltsev April 24, 2008 Abstract The combinatorial duality used in Gross-Siebert approach to mirror symmetry is the discrete Legendre transform
More informationConvex Optimization M2
Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with I.M. Bomze (Wien) and F. Jarre (Düsseldorf) IMA
More informationarxiv: v3 [math.ag] 15 Dec 2016
The number of real eigenvectors of a real polynomial Mauro Maccioni arxiv:606.04737v3 [math.ag] 5 Dec 06 9 November 06 Abstract I investigate on the number t of real eigenvectors of a real symmetric tensor.
More informationReal Symmetric Matrices and Semidefinite Programming
Real Symmetric Matrices and Semidefinite Programming Tatsiana Maskalevich Abstract Symmetric real matrices attain an important property stating that all their eigenvalues are real. This gives rise to many
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with M. Bomze (Wien) and F. Jarre (Düsseldorf) and
More informationAxioms for the Real Number System
Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,
More informationSOLVING SOLVABLE QUINTICS. D. S. Dummit
D. S. Dummit Abstract. Let f(x) = x 5 + px 3 + qx + rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if
More informationAN INTRODUCTION TO TORIC SURFACES
AN INTRODUCTION TO TORIC SURFACES JESSICA SIDMAN 1. An introduction to affine varieties To motivate what is to come we revisit a familiar example from high school algebra from a point of view that allows
More informationA Complete Analysis of Resultants and Extraneous Factors for Unmixed Bivariate Polynomial Systems using the Dixon formulation
A Complete Analysis of Resultants and Extraneous Factors for Unmixed Bivariate Polynomial Systems using the Dixon formulation Arthur Chtcherba Deepak Kapur Department of Computer Science University of
More informationGALE DUALITY FOR COMPLETE INTERSECTIONS
GALE DUALITY FOR COMPLETE INTERSECTIONS Abstract. We show that every complete intersection defined by Laurent polynomials in an algebraic torus is isomorphic to a complete intersection defined by master
More informationToric Varieties. Madeline Brandt. April 26, 2017
Toric Varieties Madeline Brandt April 26, 2017 Last week we saw that we can define normal toric varieties from the data of a fan in a lattice. Today I will review this idea, and also explain how they can
More informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More informationarxiv: v1 [math.nt] 15 Sep 2009
REDUCTION THEORY OF POINT CLUSTERS IN PROJECTIVE SPACE arxiv:0909.2808v1 [math.nt] 15 Sep 2009 MICHAEL STOLL 1. Introduction In this paper, we generalise the results of [5] on the reduction theory of binary
More information4. Be able to set up and solve an integral using a change of variables. 5. Might be useful to remember the transformation formula for rotations.
Change of variables What to know. Be able to find the image of a transformation 2. Be able to invert a transformation 3. Be able to find the Jacobian of a transformation 4. Be able to set up and solve
More informationThe product of matrices
Geometria Lingotto LeLing9: Matrix multiplication C ontents: The product of two matrices Proof of the Rank theorem The algebra of square matrices: the product is not commutative Rotations and elementary
More information9. Interpretations, Lifting, SOS and Moments
9-1 Interpretations, Lifting, SOS and Moments P. Parrilo and S. Lall, CDC 2003 2003.12.07.04 9. Interpretations, Lifting, SOS and Moments Polynomial nonnegativity Sum of squares (SOS) decomposition Eample
More informationPowers, Roots and Radicals. (11) Page #23 47 Column, #51, 54, #57 73 Column, #77, 80
Algebra 2/Trig Unit Notes Packet Name: Period: # Powers, Roots and Radicals () Homework Packet (2) Homework Packet () Homework Packet () Page 277 # 0 () Page 277 278 #7 6 Odd (6) Page 277 278 #8 60 Even
More informationAffine Geometry and the Discrete Legendre Transfrom
Affine Geometry and the Discrete Legendre Transfrom Andrey Novoseltsev Department of Mathematics University of Washington April 25, 2008 Andrey Novoseltsev (UW) Affine Geometry April 25, 2008 1 / 24 Outline
More information