Quaternionic geometry of matroids

Building on a recent paper [8], here we argue that the combinatorics of matroids are intimately related to the geometry and topology of toric hyperkähler varieties. We show that just like toric varieties occupy a central role in Stanley’s proof for the necessity of McMullen’s conjecture (or g-inequalities) about the classification of face vectors of simplicial polytopes, the topology of toric hyperkähler varieties leads to new restrictions on face vectors of matroid complexes. Namely in this paper we will give two proofs that the injectivity part of the Hard Lefschetz theorem survives for toric hyperkähler varieties. We explain how this implies the g-inequalities for rationally representable matroids. We show how the geometrical intuition in the first proof, coupled with results of Chari [3], leads to a proof of the g-inequalities for general matroid complexes, which is a recent result of Swartz [20]. The geometrical idea in the second proof will show that a pure O-sequence should satisfy the g-inequalities, thus showing that our result is in fact a consequence of a long-standing conjecture of Stanley.     

Some Global Optimization Problems on Stiefel Manifolds

Optimization on Stiefel manifolds was discussed by Rapcsák in earlier papers, and some global optimization methods were considered and tested on Stiefel manifolds. In the paper, test functions are given with known global optimum points and their optimal function values. A restriction, which leads to a discretization of the problem is suggested, which results in a problem equivalent to the well-known assignment problem.     

Moments of an exponential functional of random walks and permutations with given descent sets

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ₁ + ξ₁ξ₂ + ξ₁ξ₂ξ₃ + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ _k = E(ξ ^k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.     

A Smoothing Newton Method for Semi-Infinite Programming

This paper is concerned with numerical methods for solving a semi-infinite programming problem. We reformulate the equations and nonlinear complementarity conditions of the first order optimality condition of the problem into a system of semismooth equations. By using a perturbed Fischer–Burmeister function, we develop a smoothing Newton method for solving this system of semismooth equations. An advantage of the proposed method is that at each iteration, only a system of linear equations is solved. We prove that under standard assumptions, the iterate sequence generated by the smoothing Newton method converges superlinearly/quadratically.     

A Multidimensional Branch-and-Prune Method for Interval Global Optimization

In this paper a new multidimensional extension of the recently developed one-dimensional enclosure method called kite is given for interval global optimization. A more sophisticated version of the pruning technique based on the kite method is introduced. By the new componentwise approach all the one-dimensional theoretical results and procedures can be used in the higher-dimensional case. The possibilities in the implementation of the new algorithm together with numerical results on 40 standard test problems are presented.     

Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems

This paper provides an analysis of the polynomiality of primal-dual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu’s scaled Lipschitz condition, but is also applicable to mappings that are not monotone. We show that a family of primal-dual affine scaling algorithms generates an approximate solution (given a precision ε) of the nonlinear complementarity problem in a finite number of iterations whose order is a polynomial ofn, ln(1/ε) and a condition number. If the mapping is linear then the results in this paper coincide with the ones in Jansen et al., SIAM Journal on Optimization 7 (1997) 126–140. Research supported in part by Grant-in-Aids for Encouragement of Young Scientists (06750066) from the Ministry of Education, Science and Culture, Japan. Research supported by Dutch Organization for Scientific Research (NWO), grant 611-304-028     

Stability of Blowup for a 1D Model of Axisymmetric 3D Euler Equation

The question of the global regularity versus finite- time blowup in solutions of the 3D incompressible Euler equation is a major open problem of modern applied analysis. In this paper, we study a class of one-dimensional models of the axisymmetric hyperbolic boundary blow-up scenario for the 3D Euler equation proposed by Hou and Luo (Multiscale Model Simul 12:1722–1776, 2014) based on extensive numerical simulations. These models generalize the 1D Hou–Luo model suggested in Hou and Luo Luo and Hou (2014), for which finite-time blowup has been established in Choi et al. (arXiv preprint. arXiv:1407.4776, 2014). The main new aspects of this work are twofold. First, we establish finite-time blowup for a model that is a closer approximation of the three-dimensional case than the original Hou–Luo model, in the sense that it contains relevant lower-order terms in the Biot–Savart law that have been discarded in Hou and Luo Choi et al. (2014). Secondly, we show that the blow-up mechanism is quite robust, by considering a broader family of models with the same main term as in the Hou–Luo model. Such blow-up stability result may be useful in further work on understanding the 3D hyperbolic blow-up scenario.     

Strengthened splitting methods for computing resolvents

Computational Optimization and Applications - In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each...     

Complement of forms

The notions of the parallel sum, the parallel difference, and the complement of two nonnegative sesquilinear forms were introduced and studied by Hassi, Sebestyé and de Snoo in Hassi et al. (Oper Theory Adv Appl 198:211–227, 2010) and Hassi et al. (J Funct Anal 257(12):3858–3894, 2009). In this paper we continue these investigations. The Galois correspondence induced by the map ${\mathfrak{m} \mapsto \mathfrak{m}_\mathfrak{t}}$ (where ${\mathfrak{m}_\mathfrak{t}}$ denotes the ${\mathfrak{t}}$ -complement of ${\mathfrak{m}}$ ) is also studied. Inspired by the work of Eriksson and Leutwiler Eriksson and Leutwiler (Math Ann 274:301–317, 1986), we introduce the notion of quasi-unit for nonnegative sesquilinear forms. The quasi-units are characterized by means of the complement and the disjoint part. It is also shown that the ${{\mathfrak{t}}}$ -quasi-units coincide with the extreme points of the convex set ${\mathfrak{z}: 0 \leq \mathfrak{z} \leq \mathfrak{t}\}}$ .