Related papers: A Positivity-Preserving Relaxation Algorithm
In this paper, the compact linearization approach originally proposed for binary quadratic programs with assignment constraints is generalized to such programs with arbitrary linear equations and inequalities that have positive coefficients…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
This work uses a linear relaxation method to develop efficient numerical schemes for the time-fractional Allen-Cahn and Cahn-Hilliard equations. The L1+-CN formula is used to discretize the fractional derivative, and an auxiliary variable…
Large-scale simulations of the wave equation in electromagnetism, seismology, and acoustics, can be solved efficiently by finite difference methods. The accuracy of these numerical solutions usually depends on the minimization of…
Positive systems naturally arise in situations where the model tracks physical quantities. Although the linear case is well understood, analysis and controller design for nonlinear positive systems remain challenging. Model reduction…
Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.
In this paper we prove global existence of weak solutions, their regularization, and relaxation for large data for a broad class of Fokker-Planck-Alignment models which appear in collective dynamics. The main feature of these results, as…
In this work, we propose a nonlinear stabilization technique for scalar conservation laws with implicit time stepping. The method relies on an artificial diffusion method, based on a graph-Laplacian operator. It is nonlinear, since it…
We consider a parametric family of quadratically constrained quadratic programs (QCQP) and their associated semidefinite programming (SDP) relaxations. Given a nominal value of the parameter at which the SDP relaxation is exact, we study…
The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both…
In this manuscript, we present a comprehensive theoretical and numerical framework for the control of production-destruction differential systems. The general finite horizon optimal control problem is formulated and addressed through the…
We discuss a nonlinear model for the relaxation by energy redistribution within an isolated, closed system composed of non-interacting identical particles with energy levels e_i with i=1,2,...,N. The time-dependent occupation probabilities…
Combining recent moment and sparse semidefinite programming (SDP) relaxation techniques, we propose an approach to find smooth approximations for solutions of problems involving nonlinear differential equations. Given a system of nonlinear…
The expectation--maximization (EM) algorithm combines global monotonicity, local linear convergence, and strong practical robustness, but these features are usually analyzed separately. Global descent is nonlinear, whereas local convergence…
The focus of the present work is the (theoretical) approximation of a solution of the p(x)-Poisson equation. To devise an iterative solver with guaranteed convergence, we will consider a relaxation of the original problem in terms of a…
Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a…
Quantum annealing has garnered significant attention as meta-heuristics inspired by quantum physics for combinatorial optimization problems. Among its many applications, nonnegative/binary matrix factorization stands out for its complexity…
In earlier work we have studied a method for discretization in time of a parabolic problem which consists in representing the exact solution as an integral in the complex plane and then applying a quadrature formula to this integral. In…
Many time-dependent differential equations are equipped with invariants. Preserving such invariants under discretization can be important, e.g., to improve the qualitative and quantitative properties of numerical solutions. Recently,…
We consider numerical methods for the Poisson-Nernst-Planck-Cahn-Hilliard (PNPCH) equations with steric interactions. We propose a novel energy stable numerical scheme that respects mass conservation and positivity at the discrete level.…