Related papers: A note on algebraic Riccati equations associated w…

In this paper, the discrete-time modified algebraic Riccati equation (MARE) is solved when the system model is completely unavailable. To achieve this, firstly a brand new iterative method based on the standard discrete-time algebraic…

Conventional ways to solve optimization problems on low-rank matrix sets which appear in great number of applications ignore its underlying structure of an algebraic variety and existence of singular points. This leads to appearance of…

This paper studies the solution existence of the continuous-time algebraic Riccati equation (CARE). We formulate the CARE as two constrained polynomial optimization problems, and then use Lasserre's hierarchy of semi-definite relaxations to…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

In this paper, we discuss numerical methods for solving large-scale continuous-time algebraic Riccati equations. These methods have been the focus of intensive research in recent years, and significant progress has been made in both the…

We prove existence of non-commutative crepant resolutions (in the sense of van den Bergh) of quotient singularities by finite and linearly reductive group schemes in positive characteristic. In dimension two, we relate these to resolutions…

I present here a pedagogical introduction to the works by Rashel Tublin and Yan V. Fyodorov on random linear systems with quadratic constraints, using tools from Random Matrix Theory and replicas. These notes illustrate and complement the…

Continuous-time algebraic Riccati equations can be found in many disciplines in different forms. In the case of small-scale dense coefficient matrices, stabilizing solutions can be computed to all possible formulations of the Riccati…

In this paper, we focus on using optimization methods to solve matrix equations by transforming the problem of solving the Sylvester matrix equation or continuous algebraic Riccati equation into an optimization problem. Initially, we use a…

This paper is divided to two parts. In the first part, we provide elementary proofs for some important results in multi-objective optimization. The given proofs are so simple and short in compared to the existing ones. Also, a Pareto…

In this work, we demonstrate that the Bochner integral representation of the Algebraic Riccati Equations (ARE) are well-posed without any compactness assumptions on the coefficient and semigroup operators. From this result, we then are able…

In this paper, we extend the eigenvalue method of the algebraic Riccati equation to the differential Riccati equation (DRE) in contraction analysis. One of the main results is showing that solutions to the DRE can be expressed as functions…

We study the max-algebraic analogue of equations involving Z-matrices and M-matrices, with an outlook to a more general algebraic setting. We show that these equations can be solved using the Frobenius trace down method in a way similar to…

Recent quasi-optimal error estimates for the finite element approximation of total-variation regularized minimization problems require the existence of a Lipschitz continuous dual solution. We discuss the validity of this condition and…

Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…

Alternating Minimization is a widely used and empirically successful heuristic for matrix completion and related low-rank optimization problems. Theoretical guarantees for Alternating Minimization have been hard to come by and are still…

This paper is concerned with the question of reconstructing a vector in a finite-dimensional real or complex Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We present new…

In [Steinerberger, Q. Appl. Math., 79:3, 419-429, 2021] and [Shao, SIAM J. Matrix Anal. Appl. 44(1), 212-239, 2023], two new types of Kaczmarz algorithms, which share some similarities, for consistent linear systems were proposed. These two…

A recent problem [B. Gardas, J. Math. Phys. 52, 042104 (2011)] concerning an antilinear solution of the Riccati equation is solved. We also exemplify that a simplification of the Riccati equation, even under reasonable assumptions, can lead…

In many applications, it makes sense to solve the least square problems with nonnegative constraints. In this article, we present a new multiplicative iteration that monotonically decreases the value of the nonnegative quadratic programming…