[2403.10306] A Unified Non-Strict Finsler Lemma
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Optimization and Control

arXiv:2403.10306 (math)
[Submitted on 15 Mar 2024 (v1), last revised 18 Jun 2024 (this version, v2)]

Title:A Unified Non-Strict Finsler Lemma

Authors:T.J. Meijer, K.J.A. Scheres, S. van den Eijnden, T. Holicki, C.W. Scherer, W.P.M.H. Heemels
View PDF HTML (experimental)
Abstract:In this paper, we present a unified general non-strict Finsler lemma. This result is general in the sense that it does not impose any restrictions on the involved matrices and, thereby, it encompasses all existing non-strict versions of Finsler's lemma that do impose such restrictions. To further illustrate its usefulness, we showcase applications of the non-strict Finsler's lemma in deriving a structured solution to a special case of the non-strict projection lemma, and we use the unified non-strict Finsler's lemma to prove a more general version of the matrix Finsler's lemma.
Subjects: Optimization and Control (math.OC); Systems and Control (eess.SY)
Cite as: arXiv:2403.10306 [math.OC]
  (or arXiv:2403.10306v2 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2403.10306
Related DOI: https://doi.org/10.1109/LCSYS.2024.3415473

Submission history

From: Tomas Meijer [view email]
[v1] Fri, 15 Mar 2024 13:47:15 UTC (88 KB)
[v2] Tue, 18 Jun 2024 10:51:07 UTC (36 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2024-03
Change to browse by:
cs
cs.SY
eess
eess.SY
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)