Related papers: The solution to the initial value problem for the …
In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of…
In this paper we study the subset sum problem with real numbers. Starting from the given problem, we formulate a quadratic maximization problem over a polytope which is eventually written as a distance maximization to a fixed point. For…
In this article we derive a priori error estimates for the $hp$-version of the mortar finite element method for parabolic initial-boundary value problems. Both semidiscrete and fully discrete methods are analysed in $L^2$- and $H^1$-norms.…
We present a continuous/discontinuous Galerkin method for approximating solutions to a fourth order elliptic PDE on a surface embedded in $\mathbb{R}^3$. A priori error estimates, taking both the approximation of the surface and the…
The inverse reflector problem arises in geometrical nonimaging optics: Given a light source and a target, the question is how to design a reflecting free-form surface such that a desired light density distribution is generated on the…
We present an efficient and parsimonious algorithm to solve mixed initial/final-value problems. The algorithm optimally limits the memory storage and the computational time requirements: with respect to a simple forward integration, the…
In this study, two initial boundary value problems for one dimensional advection-dispersion equation are solved by differential quadrature method based on sine cardinal functions. Pure advection problem modeling transport of conservative…
We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by the summation of a smooth, possibly nonconvex function and a convex simple function. The…
In this paper we discuss a framework for the polynomial approximation to the solution of initial value problems for differential equations. The framework, initially devised for the approximation of ordinary differential equations, is…
We present a method for solving the general mixed constrained convex quadratic programming problem using an active set method on the dual problem. The approach is similar to existing active set methods, but we present a new way of solving…
We show that the initial value problem of a periodic box-ball system can be solved in an elementary way using simple combinatorial methods.
We present two numerical methods for the fully nonlinear elliptic Monge-Ampere equation. The first is a pseudo transient continuation method and the second is a pure pseudo time marching method. The methods are proven to converge to a…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…
In this study, we consider the numerical solution of the Neumann initial boundary value problem for the wave equation in 2D domains. Employing the Laguerre transform with respect to the temporal variable, we effectively transform this…
We consider the periodic initial-value problem for the Korteweg-de Vries equation that we discretize in space by a spectral Fourier-Galerkin method and in time by an implicit, high order, Runge-Kutta scheme of composition type based on the…
This paper deals with approximate solutions of a nonsmooth semi-infinite programming with multiple interval-valued objective functions. We first introduce four types of approximate quasi Pareto solutions of the considered problem by…
We present a novel efficient theoretical and numerical framework for solving global non-convex polynomial optimization problems. We analytically demonstrate that such problems can be efficiently reformulated using a non-linear objective…
In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…
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…