相关论文: The level set method for the two-sided eigenproble…
We study the equipotential surfaces around of a two particle system in 3-d under a pairwise good potential as the one of Van der Waals. The level sets are completely determined by the solutions of polynomials of at most fourth degree that…
We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to…
This paper details a methodology to transcribe an optimal control problem into a nonlinear program for generation of the trajectories that optimize a given functional by approximating only the highest order derivatives of a given system's…
In this paper, we study a class of bilevel programming problem where the inner objective function is strongly convex. More specifically, under some mile assumptions on the partial derivatives of both inner and outer objective functions, we…
We establish sharp well-posedness and approximation estimates for variational saddle point systems at the continuous level. The main results of this note have been known to be true only in the finite dimensional case. Known spectral results…
We obtain spectral inequalities and asymptotic formulae for the discrete spectrum of the operator $\frac12\, \log(-\Delta)$ in an open set $\Omega\in\Bbb R^d$, $d\ge2$, of finite measure with Dirichlet boundary conditions. We also derive…
We introduce a level set based approach to Bayesian geometric inverse problems. In these problems the interface between different domains is the key unknown, and is realized as the level set of a function. This function itself becomes the…
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems with common $2\times 2$ block structure. It is assumed that the upper diagonal block varies between different versions while the lower…
In this paper we study an eigenvalue problem for the so called $(p,2)$-Laplace operator on a smooth bounded domain under a nonlinear Steklov type boundary condition, namely \begin{equation} \left\{ \begin{aligned} -\Delta_pu-\Delta u &…
We consider an eigenvalue problem for an inverted one dimensional harmonic oscillator. We find a complete description for the eigenproblem in $C^{\infty}(\mathbb R)$. The eigenfunctions are described in terms of the confluent hypergeometric…
The method of second order relative spectra has been shown to reliably approximate the discrete spectrum for a self-adjoint operator. We extend the method to normal operators and find optimal convergence rates for eigenvalues and…
When faced with multiple minima of an "inner-level" convex optimization problem, the convex bilevel optimization problem selects an optimal solution which also minimizes an auxiliary "outer-level" convex objective of interest. Bilevel…
A spectral method for solving linear partial differential equations (PDEs) with variable coefficients and general boundary conditions defined on rectangular domains is described, based on separable representations of partial differential…
This paper presents a mixed basis approach for Laplace eigenvalue problems, which treats the boundary as a perturbation of the free Laplace operator. The method separates the boundary from the volume via a generic function that can be…
In this paper we study convex bi-level optimization problems for which the inner level consists of minimization of the sum of smooth and nonsmooth functions. The outer level aims at minimizing a smooth and strongly convex function over the…
We study the problem of approximating plurisubharmonic functions on a bounded domain $\Omega$ by continuous plurisubharmonic functions defined on neighborhoods of $\bar\Omega$. It turns out that this problem can be linked to the problem of…
Let $L$ be a linear differential operator with constant coefficients of order $n$ and complex eigenvalues $\lambda_{0},...,\lambda_{n}$. Assume that the set $U_{n}$ of all solutions of the equation $Lf=0$ is closed under complex…
We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…
We approximate the backward reachable set of discrete-time autonomous polynomial systems using the recently developed occupation measure approach. We formulate the problem as an infinite-dimensional linear programming (LP) problem on…
In this paper, we show that the bundle method can be applied to solve semidefinite programming problems with a low rank solution without ever constructing a full matrix. To accomplish this, we use recent results from randomly sketching…