Related papers: A Suitable Conjugacy for the l0 Pseudonorm
Lax pairs are a useful tool in finding conserved quantities of some dynamical systems. In this expository article, we give a motivated introduction to the idea of a Lax pair of matrices $(L,A)$, first for mechanical systems such as the…
Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…
Sparse high dimensional graphical model selection is a topic of much interest in modern day statistics. A popular approach is to apply l1-penalties to either (1) parametric likelihoods, or, (2) regularized regression/pseudo-likelihoods,…
Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…
In this paper, nonconvex and nonsmooth models for compressed sensing (CS) and low rank matrix completion (MC) is studied. The problem is formulated as a nonconvex regularized leat square optimization problems, in which the l0-norm and the…
A rack is a set with a binary operation such that left multiplications are automorphisms of the set and a quandle is a rack satisfying a certain condition. Let $S$ be a subset of a finite group $G$ which is closed under the conjugation…
A flag domain of a real from $G_0$ of a complex semismiple Lie group $G$ is an open $G_0$-orbit $D$ in a (compact) $G$-flag manifold. In the usual way one reduces to the case where $G_0$ is simple. It is known that if $D$ possesses…
We investigate isoperimetric inequalities for Lipschitz 2-spheres in CAT(0) spaces, proving bounds on the volume of efficient null-homotopies. In one dimension lower, it is known that a quadratic inequality with a constant smaller than…
We study the problem of matrix Lie algebra conjugacy. Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley--Sohoni Geometric Complexity Theory program. A matrix Lie…
We extend the duality principle for the $\Gamma$-convergence of convex lower semicontinuous functions, which was previously established only in separable reflexive Banach spaces, to the broader class of weakly compactly generated (WCG)…
We consider the problem of learning the underlying graph of a sparse Ising model with $p$ nodes from $n$ i.i.d. samples. The most recent and best performing approaches combine an empirical loss (the logistic regression loss or the…
We study the connection between conjugations of a special kind of dynamical systems, called P-configurations, and solutions to homogeneous Cauchy type functional equations. We find that any two regular P-configurations are conjugate by a…
An antinorm is a concave nonnegative homogeneous functional on a convex cone. It is shown that if the cone is polyhedral, then every antinorm has a unique continuous extension from the interior of the cone. The main facts of the duality…
Recently, based on the idea of randomizing space theory, random convex analysis has been being developed in order to deal with the corresponding problems in random environments such as analysis of conditional convex risk measures and the…
We introduce the concept of sos-convex Lyapunov functions for stability analysis of both linear and nonlinear difference inclusions (also known as discrete-time switched systems). These are polynomial Lyapunov functions that have an…
We investigate a novel characteristic of the conjugate function associated to a generic convex optimization problem, which can subsequently be leveraged for efficient dual decomposition methods. In particular, under mild assumptions, we…
This paper studies linear relations and their self-adjoint realizations arising from 2d-dimensional canonical systems, with a focus on how the symplectic structure interacts with boundary conditions. Understanding this interplay allows us…
Let $p$ be a real zero polynomial in $n$ variables. Then $p$ defines a rigidly convex set $C(p)$. We construct a linear matrix inequality of size $n+1$ in the same $n$ variables that depends only on the cubic part of $p$ and defines a…
We propose the first linear-time algorithm to compute the conjugate of (nonconvex) bivariate piecewise linear-quadratic (PLQ) functions (bivariate quadratic functions defined on a polyhedral subdivision). Our algorithm starts with computing…
The classification of one parameter local Coulomb branch solution of theories with eight supercharges is given by assuming that it is given by a genus $g$ fiberation of Riemann surfaces. The crucial point is the fact that certain conjugacy…