Finding Optimal Minors of Valuated Bimatroids
|
|
- Alison Blankenship
- 5 years ago
- Views:
Transcription
1 Finding Optimal Minors of Valuated Bimatroids Kazuo Murota Research Institute of Discrete Mathematics University of Bonn, Nassestrasse 2, Bonn, Germany September 1994; Revised: Nov. 1994, Jan Abstract As a variant of valuated matroid of Dress and Wenzel, we define the concept of a valuated bimatroid to investigate the combinatorial properties of the degree of subdeterminants of a rational function matrix. Two algorithms are developed for computing the maximum degree of a minor of specified order; the algorithms are valid also for valuated bimatroids in general. Key Words: valuated matroid, concavity, degree of subdeterminant, Smith- McMillan form of a rational function matrix. Abbreviated title: Valuated Bimatroid 1 INTRODUCTION Let A(x) = (A ij (x)) be an m n matrix with A ij (x) being a rational function in x with coefficients from a field F, and denote by δ k the highest degree of a minor of order k of A(x). That is, with δ k = max{w(i, J) I = J = k} (1) w(i, J) = deg det A[I, J], (2) where A[I, J] denotes the submatrix of A with row-set I and column-set J, and the degree of a rational function f(x) = p(x)/q(x) (with p(x), q(x) F [x]) is defined by deg f = deg p deg q. We assume det A[, ] = 1 and w(, ) = 0. Published in Applied Mathematics Letters, Vol. 8, No.4, 37 42, On leave from Research Institute for Mathematical Sciences, Kyoto University, Kyoto , Japan; Fax: ; murota@kurims.kyoto-u.ac.jp. 1
2 The present paper develops two algorithms for computing δ k by exploiting the combinatorial properties of the function w(i, J). To be specific, we first define the concept of a valuated bimatroid as a variant of valuated matroid introduced by Dress and Wenzel [1], [2]; a valuated bimatroid is nothing but a valuated matroid in a disguise, just as a bimatroid [3] (or a linking system [4]) can be identified with a matroid with a fixed base. Then, we derive two theorems; the first (Theorem 1) stating the concavity of δ k as a function of k, and the second (Theorem 2) revealing the nesting structure of the maximizers (I, J) of w(i, J). Finally we develop, based on those theorems, two different algorithms for computing δ k that work for valuated bimatroids in general, and we mention their applications to rational function matrices. The results of this paper not only contribute to the theory of valuated matroid but also have fundamental engineering significance. For example, when δ k is defined for a rational function matrix A(x) as above, we can obtain the Smith- McMillan form at infinity (known also as the structure at infinity in the literature of control theory [5]) of A(x) by computing δ k (k = 1, 2, ). When A(x) is a regular pencil, on the other hand, the δ k (k = 1, 2, ) determine the structural indices of its Kronecker form [6] (and hence the index of nilpotency) which plays an important role in the analysis of differential-algebraic equations (DAEs). See [7] for details. 2 VALUATED BIMATROID We introduce the concept of a valuated bimatroid as a variant of valuated matroids as follows. Let R and C be disjoint finite sets and let w be a map from 2 R 2 C into R { }. With w, we associate the map v : 2 R C R { }, defined by v(i J) := w(r I, J), I R, J C. (3) We define (R, C, w) to be a valuated bimatroid if (R C, v) is a valuated matroid (as defined in [1], [2]) with v(r). This means in particular that and where w(, ) (4) w(i, J) = for (I, J) S, (5) S = {(I, J) I = J, I R, J C}. By translating the exchange axiom for valuated matroids v into conditions on w, we see that (R, C, w) is a valuated bimatroid if and only if w satisfies (4), (5), and the exchange properites (E1) and (E2) below for any (I, J) S and (I, J ) S: (E1) For any i I I, at least one of the following two assertions holds: (a1) j J J : w(i, J)+w(I, J ) w(i+i, J+j )+w(i i, J j ), (b1) i I I : w(i, J)+w(I, J ) w(i i+i, J)+w(I i +i, J ). 2
3 (E2) For any j J J, at least one of the following two assertions holds: (a2) i I I : w(i, J)+w(I, J ) w(i i, J j)+w(i +i, J +j), (b2) j J J : w(i, J)+w(I, J ) w(i, J j+j )+w(i, J j +j). We define the rank r of (R, C, w) by r = max{ I (I, J) S : w(i, J) }. Remark 1 (E1) and (E2) together can be put in a more compact form as (E12) For any X I I and Y J J with X + Y = 1 there exist X I I and Y J J with X + Y = 1 such that w(i, J) + w(i, J ) w(i X + X, J Y + Y ) + w(i X + X, J Y + Y ). Remark 2 The Grassmann Plücker relations (or the Laplace expansions) imply that w(i, J) := deg det A[I, J] defines a valuated bimatroid (R, C, w) with w(, ) = 0. As is obvious from [2], a valuated bimatroid can be defined more generally from any matrix over a field with non-archimedian valuation. Remark 3 The family {(I, J) w(i, J) } constitutes the family of linked pairs of a bimatroid (or a linking system) in the sense of [4]. This follows from the correspondence between matroids and bimatroids as well as the fact ([2, Remark (i) of 1]) that the family of bases of a valuated matroid constitutes the family of bases of a matroid. To state our results we introduce notations: S k = {(I, J) I = J = k, I R, J C}, δ k = max{w(i, J) (I, J) S k }, 0 k r, M k = {(I, J) S k w(i, J) = δ k }, 0 k r. Theorem 1 The following inequality holds δ k 1 + δ k+1 2δ k, for 1 k r 1. (6) Proof. Let (I, J ) M k 1, (I +, J + ) M k+1 and i I + I. From (E1) it follows that or j J + J : δ k 1 + δ k+1 w(i + i, J + j) + w(i + i, J + j) i I I + : δ k 1 + δ k+1 w(i i + i, J ) + w(i + i + i, J + ). In the first case, the right-hand side is bounded by 2δ k since (I + i, J + j) S k and (I + i, J + j) S k ; thus (6) is established. In the second case, the righthand side is bounded by δ k 1 + δ k+1, and therefore (I i + i, J ) M k 1 and (I + i + i, J + ) M k+1. Putting (Ĩ, J ) = (I, J ), (Ĩ+, J + ) = (I + i + i, J + ), we have (Ĩ, J ) M k 1, (Ĩ+, J + ) M k+1 and Ĩ Ĩ+ = I I + 1. By applying the above argument repeatedly, we will end up with the first case since I I + decreases while the second case applies. Next we look at the families M k (k = 0, 1,, r) of the maximizers of w. 3
4 Lemma 1 Let (I k, J k ) M k and (I, J ) M k 1, where 1 k r. (1) For any i I k I, either (a 1) or (b 1) (or both) holds, where (a 1) j J k J : (I + i, J + j) M k, (I k i, J k j) M k 1, (b 1) i I I k : (I i + i, J ) M k 1, (I k i + i, J k ) M k. (2) For any j J k J, either (a 2) or (b 2) (or both) holds, where (a 2) i I k I : (I k i, J k j) M k 1, (I + i, J + j) M k, (b 2) j J J k : (I k, J k j + j ) M k, (I, J j + j) M k 1. Proof. This follows from inequalities like those in the proof of Theorem 1. Theorem 2 For any (I k, J k ) M k with 1 k r 1 there exist (I l, J l ) M l (0 l r, l k) such that ( =)I 0 I 1 I k 1 I k I k+1 I r and ( =)J 0 J 1 J k 1 J k J k+1 J r. Proof. We show the existence of such (I k 1, J k 1 ). The existence of (I k+1, J k+1 ) can be shown in a similar manner, and the existence of the other (I l, J l ) (with l k 2) follows by induction. Let (I, J ) M k 1. If I I k, we apply Lemma 1 (1) to obtain (a 1) or (b 1). In case of (a 1) we are done with (I k 1, J k 1 ) = (I k i, J k j). In case of (b 1) we put Ĩ = I i + i, J = J to get (Ĩ, J ) M k 1 with Ĩ I k = I I k 1. Applying the above argument repeatedly, we will arrive at the case (a 1) or otherwise obtain (I, J ) M k 1 with I I k. Note that J remains unchanged in the latter case. Then, we apply Lemma 1 (2) repeatedly in a similar way as long as J J k, eventually arriving at (I, J ) M k 1 with I I k and J J k. 3 ALGORITHMS Obviously, Theorem 2 suggests the following incremental (or greedy) algorithm for computing δ k for k = 0, 1,, r. This algorithm involves O(r R C ) evaluations of w to compute the whole sequence (δ 0, δ 1,, δ r ). Algorithm I I 0 := ; J 0 := ; for k := 1, 2, do Find i R I k 1, j C J k 1 that maximizes w(i k 1 + i, J k 1 + j) and put I k := I k 1 + i, J k := J k 1 + j and δ k := w(i k, J k ). The iteration stops when w(i k, J k ) =, and then the rank r is given by k 1. The second algorithm is based on Theorem 1 and relies on the greedy algorithm defined in [1] for valuated matroids. The concavity of δ k implies that for α satisfying δ k δ k 1 α δ k+1 δ k (7) 4
5 the maximum of δ l αl over 0 l r is attained by l = k. From this, it follows that δ k = kα + max{w α (I, J) (I, J) S}, (8) where since w α (I, J) = w(i, J) α I, max w α(i, J) = max max w α (I, J) = max(δ l αl) = δ k αk. (I,J) S l (I,J) S l l It should be noted here that (R, C, w α ) is again a valuated bimatroid and, hence, max (I,J) S w α (I, J) can be computed efficiently by applying the greedy algorithm of [1] to the valuated matroid associated with w α as indicated in (3). We can find k + (α) max{k max(δ l αl) = δ k αk}, l k (α) min{k max(δ l αl) = δ k αk} l by maximizing (resp. minimizing) I among the maximizers of w α (I, J) by means of a slightly modified version of the greedy algorithm of [1]. The following algorithm computes the rank r and δ k (k = 0, 1,, r) by searching for appropriate values of α. It requires O(r R C ) evaluations of w. Algorithm II δ 0 := w(, ); Let α be sufficiently small (α < 0, α : large); Maximize w α to find r = k + (α) = k (α) and δ r ; if r 2 then search(0, r). Here, the procedure search(k 1, k 2 ) is defined when k k 2 as follows. procedure search(k 1, k 2 ) α := (δ k2 δ k1 )/(k 2 k 1 ); Maximize w α to find k + = k + (α), k = k (α), δ + = δ k+ and δ = δ k ; for k < k < k + do δ k := ((k k )δ + + (k + k)δ )/(k + k ); if k k then search(k 1, k ); if k k 2 then search(k +, k 2 ). Remark 4 The above algorithms, when applied to w of (2), yield new algorithms for computing the Smith-McMillan form at infinity (see [7], [8] for other algorithms). In this case, w(i, J) can be evaluated either by interpolation (see [9] for rational function interpolation) or by combinatorial relaxation [10]. The former is superior in theoretical complexity whereas the latter in practical efficiency. The author is grateful to Andreas Dress for a stimulating comment on [7], which motivated the present work, as well as for detailed comments on the manuscript of this paper, and to Werner Terhalle for careful reading of the manuscript. 5
6 References [1] A. W. M. Dress and W. Wenzel, Valuated matroid: A new look at the greedy algorithm, Applied Mathematics Letters 3 (2), (1990). [2] A. W. M. Dress and W. Wenzel, Valuated matroids, Advances in Mathematics 93, (1992). [3] J. P. S. Kung, Bimatroids and invariants, Advances in Mathematics 30, (1978). [4] A. Schrijver, Matroids and linking systems, Journal of Combinatorial Theory B26, (1979). [5] G. C. Verghese and T. Kailath, Rational matrix structure, IEEE Transactions on Automatic Control AC 26, (1981). [6] F. R. Gantmacher, The Theory of Matrices, Chelsea, New York (1959). [7] K. Murota, Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form, Applicable Algebra in Engineering, Communication and Computing, 1995, to appear. [8] S. Iwata, K. Murota and I. Sakuta, Primal-dual combinatorial relaxation algorithms for computing the maximum degree of subdeterminants, SIAM Journal on Scientific Computing, to appear. [9] D. Braess: Nonlinear Approximation Theory, Springer-Verlag, Berlin, [10] K. Murota, Computing the degree of determinants via combinatorial relaxation, SIAM Journal on Computing 24 (4) (1995), to appear. 6
MATHEMATICAL ENGINEERING TECHNICAL REPORTS
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors in Mixed Polynomial Matrices Shun SATO (Communicated by Taayasu MATSUO)
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Induction of M-convex Functions by Linking Systems
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Induction of M-convex Functions by Linking Systems Yusuke KOBAYASHI and Kazuo MUROTA METR 2006 43 July 2006 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL
More informationM-convex Function on Generalized Polymatroid
M-convex Function on Generalized Polymatroid Kazuo MUROTA and Akiyoshi SHIOURA April, 1997 Abstract The concept of M-convex function, introduced recently by Murota, is a quantitative generalization of
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Combinatorial Analysis of Generic Matrix Pencils
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Combinatorial Analysis of Generic Matrix Pencils Satoru Iwata Ryo Shimizu METR 2004 18 March 2004 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL OF INFORMATION
More information1 date: April 2, 2015 file: murota1. (B-EXC) For x, y B and for u supp + (x y), there exists v supp (x y) such that x χ u +
1 date: April 2, 2015 file: murota1 L-CONVEX FUNCTIONS AND M- CONVEX FUNCTIONS In the field of nonlinear programming (in continuous variables) convex analysis [22, 23] plays a pivotal role both in theory
More informationMinimization and Maximization Algorithms in Discrete Convex Analysis
Modern Aspects of Submodularity, Georgia Tech, March 19, 2012 Minimization and Maximization Algorithms in Discrete Convex Analysis Kazuo Murota (U. Tokyo) 120319atlanta2Algorithm 1 Contents B1. Submodularity
More informationA Grassmann Algebra for Matroids
Joint work with Jeffrey Giansiracusa, Swansea University, U.K. Matroid (Whitney, 1935) A collection B of subsets of [n] = {1,2,...,n}, called bases, such that the basis exchange property holds: Matroid
More informationGross Substitutes Tutorial
Gross Substitutes Tutorial Part I: Combinatorial structure and algorithms (Renato Paes Leme, Google) Part II: Economics and the boundaries of substitutability (Inbal Talgam-Cohen, Hebrew University) Three
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Updated: April 14, 017 Total Positivity The final and historically the original motivation is from the study of total positive matrices, which
More informationOn Steepest Descent Algorithms for Discrete Convex Functions
On Steepest Descent Algorithms for Discrete Convex Functions Kazuo Murota Graduate School of Information Science and Technology, University of Tokyo, and PRESTO, JST E-mail: murota@mist.i.u-tokyo.ac.jp
More informationQUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY
QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Index Characterization of Differential-Algebraic Equations in Hybrid Analysis for Circuit Simulation
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Index Characterization of Differential-Algebraic Equations in Hybrid Analysis for Circuit Simulation Mizuyo TAKAMATSU and Satoru IWATA (Communicated by Kazuo
More informationLOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD
Journal of the Operations Research Society of Japan Vol 54, No 4, December 2011, pp 191 200 c The Operations Research Society of Japan LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE
More informationMeasurement partitioning and observational. equivalence in state estimation
Measurement partitioning and observational 1 equivalence in state estimation Mohammadreza Doostmohammadian, Student Member, IEEE, and Usman A. Khan, Senior Member, IEEE arxiv:1412.5111v1 [cs.it] 16 Dec
More informationDiscrete Convex Analysis
RIMS, August 30, 2012 Introduction to Discrete Convex Analysis Kazuo Murota (Univ. Tokyo) 120830rims 1 Convexity Paradigm NOT Linear vs N o n l i n e a r BUT C o n v e x vs Nonconvex Convexity in discrete
More informationA Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization James B. Orlin Sloan School of Management, MIT Cambridge, MA 02139 jorlin@mit.edu Abstract. We consider the problem of minimizing
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More informationResearch Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field
Complexity, Article ID 6235649, 9 pages https://doi.org/10.1155/2018/6235649 Research Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field Jinwang Liu, Dongmei
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. On the Pipage Rounding Algorithm for Submodular Function Maximization A View from Discrete Convex Analysis
MATHEMATICAL ENGINEERING TECHNICAL REPORTS On the Pipage Rounding Algorithm for Submodular Function Maximization A View from Discrete Convex Analysis Akiyoshi SHIOURA (Communicated by Kazuo MUROTA) METR
More informationFour new upper bounds for the stability number of a graph
Four new upper bounds for the stability number of a graph Miklós Ujvári Abstract. In 1979, L. Lovász defined the theta number, a spectral/semidefinite upper bound on the stability number of a graph, which
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
MATHEMATICAL ENGINEERING TECHNICAL REPORTS On the Kronecker Canonical Form of Singular Mixed Matrix Pencils Satoru IWATA and Mizuyo TAKAMATSU METR 2015 28 December 2015 DEPARTMENT OF MATHEMATICAL INFORMATICS
More informationRank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about
Rank-one LMIs and Lyapunov's Inequality Didier Henrion 1;; Gjerrit Meinsma Abstract We describe a new proof of the well-known Lyapunov's matrix inequality about the location of the eigenvalues of a matrix
More informationA notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations
A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is
More informationSome Remarks on the Discrete Uncertainty Principle
Highly Composite: Papers in Number Theory, RMS-Lecture Notes Series No. 23, 2016, pp. 77 85. Some Remarks on the Discrete Uncertainty Principle M. Ram Murty Department of Mathematics, Queen s University,
More informationA quantitative version of the commutator theorem for zero trace matrices
A quantitative version of the commutator theorem for zero trace matrices William B. Johnson, Narutaka Ozawa, Gideon Schechtman Abstract Let A be a m m complex matrix with zero trace and let ε > 0. Then
More informationNotes on Plücker s Relations in Geometric Algebra
Notes on Plücker s Relations in Geometric Algebra Garret Sobczyk Universidad de las Américas-Puebla Departamento de Físico-Matemáticas 72820 Puebla, Pue., México Email: garretudla@gmail.com January 21,
More informationA Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems
A Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems Daniel Cobb Department of Electrical Engineering University of Wisconsin Madison WI 53706-1691
More informationEECS 495: Combinatorial Optimization Lecture Manolis, Nima Mechanism Design with Rounding
EECS 495: Combinatorial Optimization Lecture Manolis, Nima Mechanism Design with Rounding Motivation Make a social choice that (approximately) maximizes the social welfare subject to the economic constraints
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 579 586 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Low rank perturbation
More informationM. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium
MATRIX RATIONAL INTERPOLATION WITH POLES AS INTERPOLATION POINTS M. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium B. BECKERMANN Institut für Angewandte
More informationJurgen Garlo. the inequality sign in all components having odd index sum. For these intervals in
Intervals of Almost Totally Positive Matrices Jurgen Garlo University of Applied Sciences / FH Konstanz, Fachbereich Informatik, Postfach 100543, D-78405 Konstanz, Germany Abstract We consider the class
More informationThe Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2
The Maximum Dimension of a Subspace of Nilpotent Matrices of Index L G Sweet Department of Mathematics and Statistics, University of Prince Edward Island Charlottetown, PEI C1A4P, Canada sweet@upeica J
More information8 The Gelfond-Schneider Theorem and Some Related Results
8 The Gelfond-Schneider Theorem and Some Related Results In this section, we begin by stating some results without proofs. In 1900, David Hilbert posed a general problem which included determining whether
More informationarxiv: v1 [cs.sy] 2 Apr 2019
On the Existence of a Fixed Spectrum for a Multi-channel Linear System: A Matroid Theory Approach F Liu 1 and A S Morse 1 arxiv:190401499v1 [cssy] 2 Apr 2019 Abstract Conditions for the existence of a
More informationA Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases
2558 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 48, NO 9, SEPTEMBER 2002 A Generalized Uncertainty Principle Sparse Representation in Pairs of Bases Michael Elad Alfred M Bruckstein Abstract An elementary
More informationPrimitive sets in a lattice
Primitive sets in a lattice Spyros. S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, FL 33431, U.S.A spyros@fau.unl.edu Tran van Trung Institute for Experimental
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationNotes taken by Graham Taylor. January 22, 2005
CSC4 - Linear Programming and Combinatorial Optimization Lecture : Different forms of LP. The algebraic objects behind LP. Basic Feasible Solutions Notes taken by Graham Taylor January, 5 Summary: We first
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 informationA Note on Discrete Convexity and Local Optimality
A Note on Discrete Convexity and Local Optimality Takashi Ui Faculty of Economics Yokohama National University oui@ynu.ac.jp May 2005 Abstract One of the most important properties of a convex function
More informationZero controllability in discrete-time structured systems
1 Zero controllability in discrete-time structured systems Jacob van der Woude arxiv:173.8394v1 [math.oc] 24 Mar 217 Abstract In this paper we consider complex dynamical networks modeled by means of state
More informationIntroduction to optimization
Introduction to optimization Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 24 The plan 1. The basic concepts 2. Some useful tools (linear programming = linear optimization)
More informationMustapha Ç. Pinar 1. Communicated by Jean Abadie
RAIRO Operations Research RAIRO Oper. Res. 37 (2003) 17-27 DOI: 10.1051/ro:2003012 A DERIVATION OF LOVÁSZ THETA VIA AUGMENTED LAGRANGE DUALITY Mustapha Ç. Pinar 1 Communicated by Jean Abadie Abstract.
More informationarxiv:math/ v5 [math.ac] 17 Sep 2009
On the elementary symmetric functions of a sum of matrices R. S. Costas-Santos arxiv:math/0612464v5 [math.ac] 17 Sep 2009 September 17, 2009 Abstract Often in mathematics it is useful to summarize a multivariate
More informationDual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes. Satoru FUJISHIGE and Jens MASSBERG.
RIMS-1734 Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes By Satoru FUJISHIGE and Jens MASSBERG December 2011 RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES KYOTO UNIVERSITY,
More informationInfinite elementary divisor structure-preserving transformations for polynomial matrices
Infinite elementary divisor structure-preserving transformations for polynomial matrices N P Karampetakis and S Vologiannidis Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki
More informationLinear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016
Linear Algebra Notes Lecture Notes, University of Toronto, Fall 2016 (Ctd ) 11 Isomorphisms 1 Linear maps Definition 11 An invertible linear map T : V W is called a linear isomorphism from V to W Etymology:
More informationTHE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS
SOOCHOW JOURNAL OF MATHEMATICS Volume 28, No. 4, pp. 347-355, October 2002 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS BY HUA MAO 1,2 AND SANYANG LIU 2 Abstract. This paper first shows how
More informationOn Multivariate Newton Interpolation at Discrete Leja Points
On Multivariate Newton Interpolation at Discrete Leja Points L. Bos 1, S. De Marchi 2, A. Sommariva 2, M. Vianello 2 September 25, 2011 Abstract The basic LU factorization with row pivoting, applied to
More informationFRACTIONAL PACKING OF T-JOINS. 1. Introduction
FRACTIONAL PACKING OF T-JOINS FRANCISCO BARAHONA Abstract Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum
More informationSOR- and Jacobi-type Iterative Methods for Solving l 1 -l 2 Problems by Way of Fenchel Duality 1
SOR- and Jacobi-type Iterative Methods for Solving l 1 -l 2 Problems by Way of Fenchel Duality 1 Masao Fukushima 2 July 17 2010; revised February 4 2011 Abstract We present an SOR-type algorithm and a
More informationRelationships between the Completion Problems for Various Classes of Matrices
Relationships between the Completion Problems for Various Classes of Matrices Leslie Hogben* 1 Introduction A partial matrix is a matrix in which some entries are specified and others are not (all entries
More informationDESCRIPTOR FRACTIONAL LINEAR SYSTEMS WITH REGULAR PENCILS
Int. J. Appl. Math. Comput. Sci., 3, Vol. 3, No., 39 35 DOI:.478/amcs-3-3 DESCRIPTOR FRACTIONAL LINEAR SYSTEMS WITH REGULAR PENCILS TADEUSZ KACZOREK Faculty of Electrical Engineering Białystok Technical
More informationPossible numbers of ones in 0 1 matrices with a given rank
Linear and Multilinear Algebra, Vol, No, 00, Possible numbers of ones in 0 1 matrices with a given rank QI HU, YAQIN LI and XINGZHI ZHAN* Department of Mathematics, East China Normal University, Shanghai
More informationUniform Boundedness of a Preconditioned Normal Matrix Used in Interior Point Methods
Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior Point Methods Renato D. C. Monteiro Jerome W. O Neal Takashi Tsuchiya March 31, 2003 (Revised: December 3, 2003) Abstract Solving
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationApproximating Submodular Functions. Nick Harvey University of British Columbia
Approximating Submodular Functions Nick Harvey University of British Columbia Approximating Submodular Functions Part 1 Nick Harvey University of British Columbia Department of Computer Science July 11th,
More informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationDiscrete Convex Analysis
Hausdorff Institute of Mathematics, Summer School (September 1 5, 015) Discrete Convex Analysis Kazuo Murota 1 Introduction Discrete convex analysis [18, 40, 43, 47] aims to establish a general theoretical
More information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
More informationObservations on the Stability Properties of Cooperative Systems
1 Observations on the Stability Properties of Cooperative Systems Oliver Mason and Mark Verwoerd Abstract We extend two fundamental properties of positive linear time-invariant (LTI) systems to homogeneous
More informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 10, 2011
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra PhD Preliminary Exam June 2 Name: Exam Rules: This is a closed book exam Once the exam begins you
More informationContraction Methods for Convex Optimization and Monotone Variational Inequalities No.16
XVI - 1 Contraction Methods for Convex Optimization and Monotone Variational Inequalities No.16 A slightly changed ADMM for convex optimization with three separable operators Bingsheng He Department of
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationAN ASYMPTOTIC BEHAVIOR OF QR DECOMPOSITION
Unspecified Journal Volume 00, Number 0, Pages 000 000 S????-????(XX)0000-0 AN ASYMPTOTIC BEHAVIOR OF QR DECOMPOSITION HUAJUN HUANG AND TIN-YAU TAM Abstract. The m-th root of the diagonal of the upper
More informationBuyback Problem with Discrete Concave Valuation Functions
Buyback Problem with Discrete Concave Valuation Functions Shun Fukuda 1 Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan Akiyoshi Shioura Department of Industrial Engineering
More informationSupport Vector Machine Classification via Parameterless Robust Linear Programming
Support Vector Machine Classification via Parameterless Robust Linear Programming O. L. Mangasarian Abstract We show that the problem of minimizing the sum of arbitrary-norm real distances to misclassified
More information1 Introduction Semidenite programming (SDP) has been an active research area following the seminal work of Nesterov and Nemirovski [9] see also Alizad
Quadratic Maximization and Semidenite Relaxation Shuzhong Zhang Econometric Institute Erasmus University P.O. Box 1738 3000 DR Rotterdam The Netherlands email: zhang@few.eur.nl fax: +31-10-408916 August,
More informationCutting Plane Methods I
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent
More informationON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH
ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH V. FABER, J. LIESEN, AND P. TICHÝ Abstract. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix
More information1 Maximizing a Submodular Function
6.883 Learning with Combinatorial Structure Notes for Lecture 16 Author: Arpit Agarwal 1 Maximizing a Submodular Function In the last lecture we looked at maximization of a monotone submodular function,
More informationABSOLUTE VALUES AND VALUATIONS
ABSOLUTE VALUES AND VALUATIONS YIFAN WU, wuyifan@umich.edu Abstract. We introduce the basis notions, properties and results of absolute values, valuations, discrete valuation rings and higher unit groups.
More informationRepresentations of All Solutions of Boolean Programming Problems
Representations of All Solutions of Boolean Programming Problems Utz-Uwe Haus and Carla Michini Institute for Operations Research Department of Mathematics ETH Zurich Rämistr. 101, 8092 Zürich, Switzerland
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationOptimization of Submodular Functions Tutorial - lecture I
Optimization of Submodular Functions Tutorial - lecture I Jan Vondrák 1 1 IBM Almaden Research Center San Jose, CA Jan Vondrák (IBM Almaden) Submodular Optimization Tutorial 1 / 1 Lecture I: outline 1
More informationComments and Corrections
1386 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 59, NO 5, MAY 2014 Comments and Corrections Corrections to Stochastic Barbalat s Lemma and Its Applications Xin Yu and Zhaojing Wu Abstract The proof of
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 information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationThe Cayley Hamilton Theorem
The Cayley Hamilton Theorem Attila Máté Brooklyn College of the City University of New York March 23, 2016 Contents 1 Introduction 1 1.1 A multivariate polynomial zero on all integers is identically zero............
More informationA Strongly Polynomial Simplex Method for Totally Unimodular LP
A Strongly Polynomial Simplex Method for Totally Unimodular LP Shinji Mizuno July 19, 2014 Abstract Kitahara and Mizuno get new bounds for the number of distinct solutions generated by the simplex method
More informationThe Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods
The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods by Hae-Soo Oh Department of Mathematics, University of North Carolina at Charlotte, Charlotte, NC 28223 June
More informationA combinatorial algorithm minimizing submodular functions in strongly polynomial time
A combinatorial algorithm minimizing submodular functions in strongly polynomial time Alexander Schrijver 1 Abstract We give a strongly polynomial-time algorithm minimizing a submodular function f given
More informationApplications of the Inverse Theta Number in Stable Set Problems
Acta Cybernetica 21 (2014) 481 494. Applications of the Inverse Theta Number in Stable Set Problems Miklós Ujvári Abstract In the paper we introduce a semidefinite upper bound on the square of the stability
More informationA determinant characterization of moment sequences with finitely many mass-points
To appear in Linear and Multilinear Algebra Vol 00, No 00, Month 20XX, 1 9 A determinant characterization of moment sequences with finitely many mass-points Christian Berg a and Ryszard Szwarc b a Department
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationLecture 5 January 16, 2013
UBC CPSC 536N: Sparse Approximations Winter 2013 Prof. Nick Harvey Lecture 5 January 16, 2013 Scribe: Samira Samadi 1 Combinatorial IPs 1.1 Mathematical programs { min c Linear Program (LP): T x s.t. a
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Discrete Hessian Matrix for L-convex Functions
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Discrete Hessian Matrix for L-convex Functions Satoko MORIGUCHI and Kazuo MUROTA METR 2004 30 June 2004 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL
More informationResearch Division. Computer and Automation Institute, Hungarian Academy of Sciences. H-1518 Budapest, P.O.Box 63. Ujvári, M. WP August, 2007
Computer and Automation Institute, Hungarian Academy of Sciences Research Division H-1518 Budapest, P.O.Box 63. ON THE PROJECTION ONTO A FINITELY GENERATED CONE Ujvári, M. WP 2007-5 August, 2007 Laboratory
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Dijkstra s Algorithm and L-concave Function Maximization
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Dijkstra s Algorithm and L-concave Function Maximization Kazuo MUROTA and Akiyoshi SHIOURA METR 2012 05 March 2012; revised May 2012 DEPARTMENT OF MATHEMATICAL
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationSufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof
Sufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof David M. Mandy Department of Economics University of Missouri 118 Professional Building Columbia, MO 65203 USA mandyd@missouri.edu
More informationMATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018
MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S
More informationApplications of Controlled Invariance to the l 1 Optimal Control Problem
Applications of Controlled Invariance to the l 1 Optimal Control Problem Carlos E.T. Dórea and Jean-Claude Hennet LAAS-CNRS 7, Ave. du Colonel Roche, 31077 Toulouse Cédex 4, FRANCE Phone : (+33) 61 33
More informationOn the closures of orbits of fourth order matrix pencils
On the closures of orbits of fourth order matrix pencils Dmitri D. Pervouchine Abstract In this work we state a simple criterion for nilpotentness of a square n n matrix pencil with respect to the action
More informationConstraint Solving for Program Verification: Theory and Practice by Example
Constraint Solving for Program Verification: Theory and Practice by Example Andrey Rybalchenko Technische Universität München Abstract. Program verification relies on the construction of auxiliary assertions
More information1 Simplex and Matrices
1 Simplex and Matrices We will begin with a review of matrix multiplication. A matrix is simply an array of numbers. If a given array has m rows and n columns, then it is called an m n (or m-by-n) matrix.
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationM-convex Functions on Jump Systems A Survey
Discrete Convexity and Optimization, RIMS, October 16, 2012 M-convex Functions on Jump Systems A Survey Kazuo Murota (U. Tokyo) 121016rimsJUMP 1 Discrete Convex Analysis Convexity Paradigm in Discrete
More information