相关论文: Series solution of Laplace problems
The purpose of this work is to study an approximation to an abstract Bessel-type problem, which is a generalization of the extension problem associated with fractional powers of the Laplace operator. Motivated by the success of such…
We propose a semi-proximal augmented Lagrangian based decomposition method for convex composite quadratic conic programming problems with primal block angular structures. Using our algorithmic framework, we are able to naturally derive…
We introduce a comprehensive framework for analyzing convergence rates for infinite dimensional linear programming problems (LPs) within the context of the moment-sum-of-squares hierarchy. Our primary focus is on extending the existing…
In this paper we study the existence and the analytic dependence upon domain perturbation of the solutions of a nonlinear nonautonomous transmission problem for the Laplace equation. The problem is defined in a pair of sets consisting of a…
Constrained optimization problems appear in a wide variety of challenging real-world problems, where constraints often capture the physics of the underlying system. Classic methods for solving these problems rely on iterative algorithms…
The very weak solution of the Poisson equation with $L^2$ boundary data is defined by the method of transposition. The finite element solution with regularized boundary data converges in the $L^2(\Omega)$-norm with order $1/2$ in convex…
We consider the Poisson equation with homogeneous Dirichlet conditions in a family of domains in $R^{n}$ indexed by a small parameter $\epsilon$. The domains depend on $\epsilon$ only within a ball of radius proportional to $\epsilon$ and,…
In a 1990 paper Helton and Young showed that under certain conditions the optimal solution of the Nehari problem corresponding to a finite rank Hankel operator with scalar entries can be efficiently approximated by certain functions defined…
Martingale methods are used to study the almost everywhere convergence of general function series. Applications are given to ergodic series, which improves recent results of Fan \cite{FanETDS}, and to dilated series, including Davenport…
The aim of this article is to prove strong convergence results on the difference between the solution to highly oscillatory problems posed in thin domains and its two-scale expansion. We first consider the case of the linear diffusion…
We establish multiparameter resolvent trace expansions for elliptic boundary value problems, polyhomogeneous both in the resolvent and the auxiliary parameter. The present analysis is rooted in the joint project with Matthias Lesch on…
Lagrangian-based methods are classical methods for solving convex optimization problems with equality constraints. We present novel prediction-correction frameworks for such methods and their variants, which can achieve $O(1/k)$ non-ergodic…
Shape-constrained convex regression problem deals with fitting a convex function to the observed data, where additional constraints are imposed, such as component-wise monotonicity and uniform Lipschitz continuity. This paper provides a…
The standard mixed finite element approximations of Hodge Laplace problems associated with the de Rham complex are based on proper discrete subcomplexes. As a consequence, the exterior derivatives, which are local operators, are computed…
We present expressions for the coefficients which arise in asymptotic expansions of multiple integrals of Laplace type (the first term of which is known as Laplace's approximation) in terms of asymptotic series of the functions in the…
We present a successive constraint approach that makes it possible to cheaply solve large-scale linear matrix inequalities for a large number of parameter values. The efficiency of our method is made possible by an offline/online…
Inverse problems are in many cases solved with optimization techniques. When the underlying model is linear, first-order gradient methods are usually sufficient. With nonlinear models, due to nonconvexity, one must often resort to…
Asymptotic expansions are obtained for contour integrals of the form \[ \int_a^b \exp \left( - zp(t) + z^{\nu /\mu } r(t) \right)q(t)dt, \] in which $z$ is a large real or complex parameter, $p(t)$, $q(t)$ and $r(t)$ are analytic functions…
A fundamental class of matrix optimization problems that arise in many areas of science and engineering is that of quadratic optimization with orthogonality constraints. Such problems can be solved using line-search methods on the Stiefel…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…