相关论文: Effective Termination of Kohn's Algorithm for Sube…
We extend Fukushima's result on the finite convergence of an algorithm for the global convex feasibility problem to the local nonconvex case.
We construct and analyze a multiscale finite element method for an elliptic distributed optimal control problem with pointwise control constraints, where the state equation has rough coefficients. We show that the performance of the…
In this paper, we completely characterize the finite rank commutator and semi-commutator of two monomial-type Toeplitz operators on the Bergman space of certain weakly pseudoconvex domains. Somewhat surprisingly, there are not only plenty…
The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a…
The purpose of this paper is to prove optimal estimates for solutions of the Kohn-Laplacian for certain classes of model domains in several complex variables. This will be achieved by applying a type of singular integral operator whose…
We consider the problem of analyzing and designing gradient-based discrete-time optimization algorithms for a class of unconstrained optimization problems having strongly convex objective functions with Lipschitz continuous gradient. By…
In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…
Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional…
We consider the Weak Galerkin finite element approximation of the Singularly Perturbed Biharmonic elliptic problem on a unit square domain with clamped boundary conditions. Shishkin mesh is used for domain discretization as the solution…
A finite difference method is constructed to solve singularly perturbed convection-diffusion problems posed on smooth domains. Constraints are imposed on the data so that only regular exponential boundary layers appear in the solution. A…
The aim of this paper is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems in finite dimensional spaces. To this end we formulate first its Fenchel dual problem and…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
In this paper we study the local behavior of a solution to second order elliptic operators with sharp singular coefficients in lower order terms. One of the main results is the bound on the vanishing order of the solution, which is a…
We discuss finite difference techniques for hyperbolic equations in non-trivial domains, as those that arise when simulating black hole spacetimes. In particular, we construct dissipative and difference operators that satisfy the {\it…
We investigate the notion of symplectic divisorial compactification for symplectic 4-manifolds with either convex or concave type boundary. This is motivated by the notion of compactifying divisors for open algebraic surfaces. We give a…
Subgradient methods comprise a fundamental class of nonsmooth optimization algorithms. Classical results show that certain subgradient methods converge sublinearly for general Lipschitz convex functions and converge linearly for convex…
In this paper, we obtain the Gehring-Hayman type theorem on smoothly bounded pseudoconvex domains of finite type in $\mathbb{C}^2$. As an application, we provide a quantitative comparison between global and local Kobayashi distances near a…
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…
We introduce the notion of extremal basis of tangent vector fields at a boundary point of finite type of a pseudo-convex domain in $\mathbb{C}^n$. Then we define the class of geometrically separated domains at a boundary point, and give a…