Related papers: Numerical Solution for an Inverse Variational Prob…
We propose a method for finding approximate solutions to multiple-choice knapsack problems. To this aim we transform the multiple-choice knapsack problem into a bi-objective optimization problem whose solution set contains solutions of the…
We propose to solve inverse problems involving the temporal evolution of physics systems by leveraging recent advances from diffusion models. Our method moves the system's current state backward in time step by step by combining an…
We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…
The alternating minimization (AM) method is a fundamental method for minimizing convex functions whose variable consists of two blocks. How to efficiently solve each subproblems when applying the AM method is the most concerned task. In…
For non convex Hamiltonians, the viscosity solution and the more geometric minimax solution of the Hamilton-Jacobi equation do not coincide in general. They are nevertheless related: we show that iterating the minimax procedure during…
By now Bayesian methods are routinely used in practice for solving inverse problems. In inverse problems the parameter or signal of interest is observed only indirectly, as an image of a given map, and the observations are typically further…
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…
An important problem that arises in many engineering applications is the boundary value problem for ordinary differential equations. There have been many computational methods proposed for dealing with this problem. The convergence of the…
A number of applications require the computation of the trace of a matrix that is implicitly available through a function. A common example of a function is the inverse of a large, sparse matrix, which is the focus of this paper. When the…
We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
The purpose of this work is to study a finite element method for finding solutions to the eigenvalue problem for the fractional Laplacian. We prove that the discrete eigenvalue problem converges to the continuous one and we show the order…
In this paper, we prove multiplicity of solutions for a class of quasilinear problems in $ \mathbb{R}^{N} $ involving variable exponents and nonlinearities of concave-convex type. The main tools used are variational methods, more precisely,…
We introduce a new numerical method, based on Bernoulli polynomials, for solving multiterm variable-order fractional differential equations. The variable-order fractional derivative was considered in the Caputo sense, while the…
We consider the numerical approximation of a system of partial differential equations involving a nonlinear Schr\"odinger equation coupled with a hyperbolic conservation law. This system arises in models for the interaction of short and…
Many real life problems can be reduced to the solution of a complex exponentials approximation problem which is usually ill posed. Recently a new transform for solving this problem, formulated as a specific moments problem in the plane, has…
We discuss the approximation of the eigensolutions associated with the Maxwell eigenvalues problem in the framework of least-squares finite elements. We write the Maxwell curl curl equation as a system of two first order equation and design…
The possibility to simulate the properties of many-body open quantum systems with a large number of degrees of freedom is the premise to the solution of several outstanding problems in quantum science and quantum information. The challenge…
We propose a novel proof technique that can be applied to attack a broad class of problems in computational complexity, when switching the order of universal and existential quantifiers is helpful. Our approach combines the standard min-max…
In this paper we present a novel numerical solution procedure for semicoercive hemivariational inequalities. As a model example we consider a unilateral semicoercive contact problem with nonmonotone friction and provide numerical results…