default search action
Martin S. Andersen 0001
Person information
- affiliation: Technical University of Denmark, Lyngby, Denmark
Other persons with the same name
- Martin S. Andersen 0002
(aka: Martin Stolpe Andersen) — University of Copenhagen, Copenhagen, Denmark
- Martin S. Andersen 0003
- Martin S. Andersen 0004
- Martin S. Andersen 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Andreas A. Bock
Preconditioner Design via Bregman Divergences. SIAM J. Matrix Anal. Appl. 45(2): 1148-1182 (2024) - [c12]João Victor Galvão da Mata
Direct System Identification of Dynamical Networks with Partial Measurements: A Maximum Likelihood Approach. ECC 2024: 3116-3123 - [i10]Remi Laumont, Yiqiu Dong, Martin S. Andersen:
Sampling Strategies in Bayesian Inversion: A Study of RTO and Langevin Methods. CoRR abs/2406.16658 (2024) - 2023
- [j17]Jasper M. Everink
Bayesian Inference with Projected Densities. SIAM/ASA J. Uncertain. Quantification 11(3): 1025-1043 (2023) - [c11]Zhuohua Shen, Yu Xu, Martin S. Andersen, Tianshi Chen:
An Efficient Implementation for Kernel-Based Regularized System Identification with Periodic Input Signals. CDC 2023: 1480-1485 - [c10]Lujing Chen
Towards Scalable Kernel-Based Regularized System Identification. CDC 2023: 1498-1504 - [c9]João Victor Galvão da Mata
AdaSub: Stochastic Optimization Using Second-Order Information in Low-Dimensional Subspaces. DSAA 2023: 1-7 - [c8]João Victor Galvão da Mata
Link Prediction on Graphs Using NLP Embedding. DSAA 2023: 1-3 - [i9]Andreas A. Bock, Martin S. Andersen:
Preconditioner Design via the Bregman Divergence. CoRR abs/2304.12162 (2023) - [i8]João Victor Galvão da Mata, Martin S. Andersen:
AdaSub: Stochastic Optimization Using Second-Order Information in Low-Dimensional Subspaces. CoRR abs/2310.20060 (2023) - [i7]João Victor Galvão da Mata
Direct System Identification of Dynamical Networks with Partial Measurements: a Maximum Likelihood Approach. CoRR abs/2311.00369 (2023) - [i6]Andreas A. Bock, Martin S. Andersen:
A New Matrix Truncation Method for Improving Approximate Factorisation Preconditioners. CoRR abs/2312.06417 (2023) - 2022
- [i5]Frederik H. Pedersen, Jakob Sauer Jørgensen, Martin S. Andersen:
A Bayesian Approach to CT Reconstruction with Uncertain Geometry. CoRR abs/2203.01045 (2022) - [i4]Katrine O. Bangsgaard
Low-rank flat-field correction for artifact reduction in spectral computed tomography. CoRR abs/2203.01637 (2022) - 2021
- [j16]Tianshi Chen
On semiseparable kernels and efficient implementation for regularized system identification and function estimation. Autom. 132: 109682 (2021) - [i3]Alessandro Perelli, Martin S. Andersen:
Regularization by Denoising Sub-sampled Newton Method for Spectral CT Multi-Material Decomposition. CoRR abs/2103.13909 (2021) - 2020
- [j15]Martin S. Andersen
Smoothing Splines and Rank Structured Matrices: Revisiting the Spline Kernel. SIAM J. Matrix Anal. Appl. 41(2): 389-412 (2020) - [c7]Hari Om Aggrawal, Martin S. Andersen
An Image Registration Framework for Discontinuous Mappings Along Cracks. WBIR 2020: 163-173
2010 – 2019
- 2019
- [j14]Yunyi Hu, Martin S. Andersen
Spectral Computed Tomography with Linearization and Preconditioning. SIAM J. Sci. Comput. 41(5): S370-S389 (2019) - 2018
- [j13]Sina Khoshfetrat Pakazad
Distributed Semidefinite Programming With Application to Large-Scale System Analysis. IEEE Trans. Autom. Control. 63(4): 1045-1058 (2018) - [j12]Hari Om Aggrawal
A Convex Reconstruction Model for X-Ray Tomographic Imaging With Uncertain Flat-Fields. IEEE Trans. Computational Imaging 4(1): 17-31 (2018) - 2017
- [j11]Sara Soltani
Tomographic image reconstruction using training images. J. Comput. Appl. Math. 313: 243-258 (2017) - [j10]Jinchao Li, Martin S. Andersen
Inexact proximal Newton methods for self-concordant functions. Math. Methods Oper. Res. 85(1): 19-41 (2017) - [j9]Sina Khoshfetrat Pakazad, Anders Hansson, Martin S. Andersen
Distributed primal-dual interior-point methods for solving tree-structured coupled convex problems using message-passing. Optim. Methods Softw. 32(3): 401-435 (2017) - 2015
- [j8]Lieven Vandenberghe, Martin S. Andersen
Chordal Graphs and Semidefinite Optimization. Found. Trends Optim. 1(4): 241-433 (2015) - [j7]Sina Khoshfetrat Pakazad, Martin S. Andersen
Distributed solutions for loosely coupled feasibility problems using proximal splitting methods. Optim. Methods Softw. 30(1): 128-161 (2015) - [i2]Sara Soltani, Martin S. Andersen, Per Christian Hansen:
Tomographic Image Reconstruction using Dictionary Priors. CoRR abs/1503.01993 (2015) - 2014
- [j6]Martin S. Andersen
Generalized row-action methods for tomographic imaging. Numer. Algorithms 67(1): 121-144 (2014) - [j5]Yifan Sun
Decomposition in Conic Optimization with Partially Separable Structure. SIAM J. Optim. 24(2): 873-897 (2014) - [j4]Martin S. Andersen
Robust Stability Analysis of Sparsely Interconnected Uncertain Systems. IEEE Trans. Autom. Control. 59(8): 2151-2156 (2014) - [j3]Tianshi Chen
System Identification Via Sparse Multiple Kernel-Based Regularization Using Sequential Convex Optimization Techniques. IEEE Trans. Autom. Control. 59(11): 2933-2945 (2014) - [c6]Tianshi Chen, Martin S. Andersen
Anomaly detection in homogenous populations: A sparse multiple kernel-based regularization method. CDC 2014: 265-270 - [c5]Leo Emil Sokoler, Gianluca Frison, Martin S. Andersen
Input-constrained model predictive control via the alternating direction method of multipliers. ECC 2014: 115-120 - 2013
- [j2]Martin S. Andersen
Logarithmic barriers for sparse matrix cones. Optim. Methods Softw. 28(3): 396-423 (2013) - 2012
- [c4]Tianshi Chen
Sparse multiple kernels for impulse response estimation with majorization minimization algorithms. CDC 2012: 1500-1505 - [c3]Martin S. Andersen
Distributed robust stability analysis of interconnected uncertain systems. CDC 2012: 1548-1553 - [c2]Christian Lyzell, Martin S. Andersen
A convex relaxation of a dimension reduction problem using the nuclear norm. CDC 2012: 2852-2857 - [i1]Martin S. Andersen, Joachim Dahl, Lieven Vandenberghe:
Logarithmic barriers for sparse matrix cones. CoRR abs/1203.2742 (2012) - 2010
- [j1]Martin S. Andersen
Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones. Math. Program. Comput. 2(3-4): 167-201 (2010) - [c1]Martin S. Andersen
Linear matrix inequalities with chordal sparsity patterns and applications to robust quadratic optimization. CACSD 2010: 7-12
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-10-07 21:19 CEST 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: