Sciweavers

59 search results - page 2 / 12
» Uniqueness of integer solution of linear equations
Sort
View
APPML
2006
71views more  APPML 2006»
13 years 7 months ago
The polynomial solution to the Sylvester matrix equation
For when the Sylvester matrix equation has a unique solution, this work provides a closed form solution, which is expressed as a polynomial of known matrices. In the case of non-u...
Qingxi Hu, Daizhan Cheng
COLOGNETWENTE
2009
13 years 8 months ago
Integer Programming with 2-Variable Equations and 1-Variable Inequalities
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
SIAMSC
2008
193views more  SIAMSC 2008»
13 years 7 months ago
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
Sadegh Jokar, Marc E. Pfetsch
MCSS
2008
Springer
13 years 6 months ago
Maximal solution to algebraic Riccati equations linked to infinite Markov jump linear systems
In this paper we deal with a perturbed algebraic Riccati equation in an infinite dimensional Banach space. Besides the interest in its own right, this class of equations appears, ...
Jack Baczynski, Marcelo D. Fragoso
ORL
2008
111views more  ORL 2008»
13 years 7 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel