Related papers: On the One-dimensional Singular Abreu Equations
We conduct a study and comparison of superiorization and optimization approaches for the reconstruction problem of superiorized/regularized least-squares solutions of underdetermined linear equations with nonnegativity variable bounds.…
We study the minimization of convex, variational integrals of linear growth among all functions in the Sobolev space $W^{1,1}$ with prescribed boundary values (or its equivalent formulation as a boundary value problem for a degenerately…
A regularization algorithm using inexact function values and inexact derivatives is proposed and its evaluation complexity analyzed. This algorithm is applicable to unconstrained problems and to problems with inexpensive constraints (that…
In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality…
We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations. For an autonomous first-order algebraic ordinary difference equations, we give an upper bound for the degrees…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…
We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this…
In this work the minimization problem for the difference of convex (DC) functions is studied by using Moreau envelopes and the descent method with Moreau gradient is employed to approximate the numerical solution. The main regularization…
Classically, a mainstream approach for solving a convex-concave min-max problem is to instead solve the variational inequality problem arising from its first-order optimality conditions. Is it possible to solve min-max problems faster by…
We prove new one-dimensional symmetry results for non-negative solutions, possibly unbounded, to the semilinear equation $ -\Delta u= f(u)$ in the upper half-space $\mathbb{R}^{N}_{+}$. Some Liouville-type theorems are also proven in the…
A singularly perturbed problem involving two singular perturbation parameters is discretized using the classical upwinded finite difference scheme on an appropriate piecewise-uniform Shishkin mesh. Scaled discrete derivatives (with scaling…
We consider fourth order singularly perturbed boundary value problems with two small parameters, and the approximation of their solution by the $hp$ version of the Finite Element Method on the {\emph{Spectral Boundary Layer}} mesh from…
We study energy minimization of a continuum Landau-de Gennes energy functional for nematic liquid crystals, in three-dimensional axisymmetric domains and in a restricted class of $\mathbb{S}^1$-equivariant (i.e., axially symmetric)…
Coupled partial differential equations defined on domains with different dimensionality are usually called mixed dimensional PDEs. We address mixed dimensional PDEs on three-dimensional (3D) and one-dimensional domains, giving rise to a…
The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of…
In this paper, we discuss numerical approximation of the eigenvalues of the one-dimensional radial Schr\"{o}dinger equation posed on a semi-infinite interval. The original problem is first transformed to one defined on a finite domain by…
A new algorithm for one-dimensional minimization is described in detail and the results of some tests on practical cases are reported and illustrated. The method requires only punctual computation of the function, and is suitable to be…
We discuss a numerical scheme to solve the continuum Kardar-Parisi-Zhang equation in generic spatial dimensions. It is based on a momentum-space discretization of the continuum equation and on a pseudo-spectral approximation of the…
We develop a sparse spectral method for a class of fractional differential equations, posed on $\mathbb{R}$, in one dimension. These equations can include sqrt-Laplacian, Hilbert, derivative and identity terms. The numerical method utilizes…