A method based on linear feasibility tests for full-rank characterization of convex combinations of matrices

DOI10.1016/j.automatica.2024.111842MaRDI QIDQ6605987

Marcelo Carvalho Minhoto Teixeira, Rubens Junqueira Magalhães Afonso, Edvaldo Assunção, Roberto Kawakami Harrop Galvão

Publication date: 16 September 2024

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

linear programmingconvex combination of matricesfeasibility problemsfull-rank conditions

Mathematics Subject Classification ID

Linear programming (90C05) Numerical computation of matrix norms, conditioning, scaling (65F35) Vector spaces, linear dependence, rank, lineability (15A03)

This page was built for publication: A method based on linear feasibility tests for full-rank characterization of convex combinations of matrices