相关论文: Optimal Approximation of Elliptic Problems by Line…

It is established existence and multiplicity of solution for the following class of quasilinear elliptic problems $$ \left\{ \begin{array}{lr} -\Delta_\Phi u = \lambda a(x) |u|^{q-2}u + |u|^{p-2}u, & x\in\Omega, u = 0, & x \in \partial…

Nonconvexity induced by the nonlinear AC power flow equations challenges solution algorithms for AC optimal power flow (OPF) problems. While significant research efforts have focused on reliably computing high-quality OPF solutions, it is…

We study the existence of solutions of the nonlinear problem $$ \left\{ \begin{alignedat}{2} -\Delta u + g(u) & = \mu & & \quad \text{in } \Omega,\\ u & = 0 & & \quad \text{on } \partial \Omega, \end{alignedat} \right. $$ where $\mu$ is a…

We consider inverse problems for non-linear hyperbolic and elliptic equations and give an introduction to the method based on the multiple linearization, or on the construction of artificial sources, to solve these problems. The method is…

In the context of unfitted finite element discretizations the realization of high order methods is challenging due to the fact that the geometry approximation has to be sufficiently accurate. Recently a new unfitted finite element method…

We present a method to derive local estimates for some classes of fully nonlinear elliptic equations. The advantage of our method is that we derive Hessian estimates directly from $C^0$ estimates. Also, the method is flexible and can be…

We obtain an error estimate between viscosity solutions and \delta-viscosity solutions of nonhomogeneous fully nonlinear uniformly elliptic equations. The main assumption, besides uniform ellipticity, is that the nonlinearity is…

Routing and scheduling problems are fundamental problems in combinatorial optimization, and also have many applications. Most variations of these problems are NP-Hard, so we need to use heuristics to solve these problems on large instances,…

The problem of finding the correct asymptotic rate of approximation by polynomial loops in dependence of the smoothness of the elements of a loop group seems not well-understood in general. For matrix Lie groups such as SU(N), it can be…

The Matching Augmentation Problem (MAP) has recently received significant attention as an important step towards better approximation algorithms for finding cheap $2$-edge connected subgraphs. This has culminated in a…

Some linear integro-differential operators have old and classical representations as the Dirichlet-to-Neumann operators for linear elliptic equations, such as the 1/2-Laplacian or the generator of the boundary process of a reflected…

Linear-parametric optimization, where multiple objectives are combined into a single objective using linear combinations with parameters as coefficients, has numerous links to other fields in optimization and a wide range of application…

A numerical method is developed to solve linear semi-infinite programming problem (LSIP) in which the iterates produced by the algorithm are feasible for the original problem. This is achieved by constructing a sequence of standard linear…

This paper proposes several novel optimization algorithms for minimizing a nonlinear objective function. The algorithms are enlightened by the optimal state trajectory of an optimal control problem closely related to the minimized objective…

This paper proposes a novel technique for the approximation of strong solutions $u \in C(\overline{\Omega}) \cap W^{2,n}_\mathrm{loc}(\Omega)$ to uniformly elliptic linear PDE of second order in nondivergence form with continuous leading…

Using maximum instead of sum, nonlinear Baskakov operator of maximum product kind is introduced by Bede et al. The present paper deals with the approximation processes for this operator. Especially in , it was indicated that the order of…

In this paper we study the following nonlinear Choquard equation $$ -\Delta u+u=\left(\ln\frac{1}{|x|}\ast F(u)\right)f(u),\quad\text{ in }\,\mathbb{R}^2, $$ where $f\in C^1(\mathbb{R})$ and $F$ is the primitive of the nonlinearity $f$…

We study the problem of learning similarity by using nonlinear embedding models (e.g., neural networks) from all possible pairs. This problem is well-known for its difficulty of training with the extreme number of pairs. For the special…

Many separable nonlinear optimization problems can be approximated by their nonlinear objective functions with piecewise linear functions. A natural question arising from applying this approach is how to break the interval of interest into…

We show error estimates for a cut finite element approximation of a second order elliptic problem with mixed boundary conditions. The error estimates are of low regularity type where we consider the case when the exact solution $u \in H^s$…