相关论文: MMS-type problems for Johnson scheme

For entire spacelike stationary 2-dimensional graphs in Minkowski spaces, we establish Bernstein type theorems under specific boundedness assumptions either on the W-function or on the total (Gaussian) curvature. These conclusions imply the…

We analyze a minimal bottom-up seesaw scenario where we require the theory to satisfy three phenomenological conditions: (i)it is supersymmetric; (ii) it has a local B-L symmetry as part of the SU(2)_L x SU(2)_R x U(1)_{B-L} gauge theory to…

This mini-course provides a presentation of the method of characteristics to initial/boundary-value problems for systems of first-order partial differential equations and to Hamilton-Jacobi variational inequalities. In particular, these…

We consider the problem of minimizing convex combinations of the first two eigenvalues of the Dirichlet-Laplacian among open sets of $R^N$ of fixed measure. We show that, by purely elementary arguments, based on the minimality condition, it…

The paper develops Newton's method of finding multiple eigenvalues with one Jordan block and corresponding generalized eigenvectors for matrices dependent on parameters. It computes the nearest value of a parameter vector with a matrix…

We consider the local sensitivity of least-squares formulations of inverse problems. The sets of inputs and outputs of these problems are assumed to have the structures of Riemannian manifolds. The problems we consider include the…

We systematically explore a class of constrained optimization problems with linear objective function and constraints that are linear combinations of logarithms of the optimization variables. Such problems can be viewed as a generalization…

We show how to sketch semidefinite programs (SDPs) using positive maps in order to reduce their dimension. More precisely, we use Johnson\hyp{}Lindenstrauss transforms to produce a smaller SDP whose solution preserves feasibility or…

In several of the class A Bianchi models, minisuperspaces admit symmetries. It is pointed out that they can be used effectively to complete the Dirac quantization program. The resulting quantum theory provides a useful platform to…

The numerical realization of the dynamic programming principle for continuous-time optimal control leads to nonlinear Hamilton-Jacobi-Bellman equations which require the minimization of a nonlinear mapping over the set of admissible…

We find the most general bosonic solution to the localization equations describing the contributions to the quantum entropy of supersymmetric black holes in four-dimensional N=2 supergravity coupled to n_v vector multiplets. This requires…

Consider a random vector with finite second moments. If its precision matrix is an M-matrix, then all partial correlations are non-negative. If that random vector is additionally Gaussian, the corresponding Markov random field (GMRF) is…

We show that the joint spectral radius of a finite collection of nonnegative matrices can be bounded by the eigenvalue of a non-linear operator. This eigenvalue coincides with the ergodic constant of a risk-sensitive control problem, or of…

We survey Bernstein-type theorems for graphical surfaces in the Euclidean space and the Lorentz-Minkowski space. More specifically, we explain several proofs of the Bernstein theorem for minimal graphs in the Euclidean 3-space. Furthermore,…

We extend Osserman's lemma on the generalized Gauss map of two-dimensional minimal graphs of higher codimension, construct a Jenkins-Serrin type special Lagrangian Scherk graph explicitly, and generalize Calabi's correspondence between…

The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but…

Several intersection matrices of $s$-subsets vs. $k$-subsets of a $v$-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known…

The minimal dominating Set (MDS) problem is a prototypical hard combinatorial optimization problem. Two years ago we studied this problem by cavity method. Although we get the solution of a given graph, which gives very good estimation of…

In this paper we discuss the controllability of two-point boundary value problem (TBVP) for one-dimensional wave equation. Some new concepts are introduced: TBVP input control problem, minimum-input solution (MS) and pre-minimum-input…

We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…