Related papers: The solution to the initial value problem for the …
We present a coordinate ascent method for a class of semidefinite programming problems that arise in non-convex quadratic integer optimization. These semidefinite programs are characterized by a small total number of active constraints and…
This work extends our previous study from S. Shrestha et al. (2024) by introducing a new abstract framework for Variational Multiscale (VMS) methods at the discrete level. We introduce the concept of what we define as the optimal projector…
We investigate semi-discrete numerical schemes based on the standard Galerkin and lumped mass Galerkin finite element methods for an initial-boundary value problem for homogeneous fractional diffusion problems with non-smooth initial data.…
We develop a class of mixed virtual volume methods for elliptic problems on polygonal/polyhedral grids. Unlike the mixed virtual element methods introduced in \cite{brezzi2014basic,da2016mixed}, our methods are reduced to symmetric,…
We study the solvability of singular Abreu equations which arise in the approximation of convex functionals subject to a convexity constraint. Previous works established the solvability of their second boundary value problems either in two…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
A new method for the solution of initial-boundary value problems for evolution PDEs recently introduced by Fokas is generalised to multidimensions. Also the relation of this method with the method of images and with the classical integral…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine…
This paper focuses on the numerical solution of initial value problems for fractional differential equations of linear type. The approach we propose grounds on expressing the solution in terms of some integral weighted by a generalized…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…
In recent time, by working in a plane with the metric associated with wave equation (the Special Relativity non-definite quadratic form), a complete formalization of space-time trigonometry and a Cauchy-like integral formula have been…
Invex programs are a special kind of non-convex problems which attain global minima at every stationary point. While classical first-order gradient descent methods can solve them, they converge very slowly. In this paper, we propose new…
We develop a variant of the Monteiro-Svaiter (MS) acceleration framework that removes the need to solve an expensive implicit equation at every iteration. Consequently, for any $p\ge 2$ we improve the complexity of convex optimization with…
A new type of multi-soliton solution to the ultradiscrete Toda equation is proposed. The solution can be transformed into another expression of solution in a perturbation form. A direct proof of the solution is also given.
In this paper we propose a convex Sum-of-Squares optimization problem for finding outer approximations of forward reachable sets for nonlinear uncertain Ordinary Differential Equations (ODE's) with either (or both) L2 or point-wise bounded…
We introduce a max-plus analogue of the Petrov-Galerkin finite element method, to solve finite horizon deterministic optimal control problems. The method relies on a max-plus variational formulation, and exploits the properties of…
We present a novel numerical method for solving ODEs while preserving polynomial first integrals. The method is based on introducing multiple quadratic auxiliary variables to reformulate the ODE as an equivalent but higher-dimensional ODE…
A new numerical method for solving a scalar ordinary differential equation with a given initial condition is introduced. The method is using a numerical integration procedure for an equivalent integral equation and is called in this paper…