default search action
Christian Grussler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Chaim Roth, Christian Grussler:
On Variation Bounding System Operators. ECC 2024: 2138-2142 - 2023
- [c11]Christian Grussler, Thiago B. Burghi:
On the Monotonicity of Frequency Response Gains. CDC 2023: 1686-1691 - 2022
- [j8]Christian Grussler, Rodolphe Sepulchre:
Variation diminishing linear time-invariant systems. Autom. 136: 109985 (2022) - [j7]Christian Grussler
, Pontus Giselsson:
Efficient Proximal Mapping Computation for Low-Rank Inducing Norms. J. Optim. Theory Appl. 192(1): 168-194 (2022) - [j6]Christian Grussler
Internally Hankel $k$-Positive Systems. SIAM J. Control. Optim. 60(4): 2373-2392 (2022) - [j5]Christian Grussler
Balanced Truncation of $k$-Positive Systems. IEEE Trans. Autom. Control. 67(1): 526-531 (2022) - 2021
- [j4]Christian Grussler
On Second-Order Cone Positive Systems. SIAM J. Control. Optim. 59(4): 2717-2739 (2021) - 2020
- [j3]Cyrus Mostajeran
Geometric Matrix Midranges. SIAM J. Matrix Anal. Appl. 41(3): 1347-1368 (2020) - [c10]Christian Grussler
Variation diminishing Hankel operators. CDC 2020: 4529-4534
2010 – 2019
- 2019
- [c9]Christian Grussler
Optimality Interpretations for Atomic Norms. ECC 2019: 1473-1477 - [c8]Christian Grussler
Strongly unimodal systems. ECC 2019: 3273-3278 - [c7]Cyrus Mostajeran, Christian Grussler, Rodolphe Sepulchre:
Affine-Invariant Midrange Statistics. GSI 2019: 494-501 - 2018
- [j2]Christian Grussler
Low-Rank Inducing Norms with Optimality Interpretations. SIAM J. Optim. 28(4): 3057-3078 (2018) - [j1]Christian Grussler
Low-Rank Optimization With Convex Constraints. IEEE Trans. Autom. Control. 63(11): 4000-4007 (2018) - 2017
- [c6]Christian Grussler
Local convergence of proximal splitting methods for rank constrained problems. CDC 2017: 702-708 - [c5]Christian Grussler
Identification of externally positive systems. CDC 2017: 6549-6554 - [i3]Christian Grussler, Pontus Giselsson:
Local Convergence of Proximal Splitting Methods for Rank Constrained Problems. CoRR abs/1710.04248 (2017) - 2016
- [c4]Christian Grussler
The use of the r* heuristic in covariance completion problems. CDC 2016: 1978-1983 - [i2]Christian Grussler, Anders Rantzer, Pontus Giselsson:
Low-rank optimization with convex constraints. CoRR abs/1606.01793 (2016) - [i1]Christian Grussler, Pontus Giselsson:
Low-Rank Inducing Norms with Optimality Interpretations. CoRR abs/1612.03186 (2016) - 2015
- [c3]Christian Grussler
On optimal low-rank approximation of non-negative matrices. CDC 2015: 5278-5283 - 2014
- [c2]Christian Grussler
Modified balanced truncation preserving ellipsoidal cone-invariance. CDC 2014: 2365-2370 - 2012
- [c1]Christian Grussler
A symmetry approach for balanced truncation of positive linear systems. CDC 2012: 4308-4313
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: