default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim Dahl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Joachim Dahl
, Erling D. Andersen:
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization. Math. Program. 194(1): 341-370 (2022)- [j10]Riley Badenbroek, Joachim Dahl:
An algorithm for nonsymmetric conic optimization inspired by MOSEK. Optim. Methods Softw. 37(3): 1027-1064 (2022) - 2020
- [j9]Ahmadreza Marandi, Etienne de Klerk, Joachim Dahl:
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy. Discret. Appl. Math. 275: 95-110 (2020)
2010 – 2019
- 2018
- [j8]Ahmadreza Marandi, Joachim Dahl, Etienne de Klerk:
A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem. Ann. Oper. Res. 265(1): 67-92 (2018) - 2013
- [j7]Martin S. Andersen, Joachim Dahl, Lieven Vandenberghe:
Logarithmic barriers for sparse matrix cones. Optim. Methods Softw. 28(3): 396-423 (2013) - 2012
- [i1]Martin S. Andersen, Joachim Dahl, Lieven Vandenberghe:
Logarithmic barriers for sparse matrix cones. CoRR abs/1203.2742 (2012) - 2011
- [j6]Tobias Lindstrøm Jensen, Jan Østergaard, Joachim Dahl, Søren Holdt Jensen:
Multiple-Description l1-Compression. IEEE Trans. Signal Process. 59(8): 3699-3711 (2011) - 2010
- [j5]Martin S. Andersen, Joachim Dahl, Lieven Vandenberghe:
Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones. Math. Program. Comput. 2(3-4): 167-201 (2010) - [j4]Joachim Dahl, Per Christian Hansen, Søren Holdt Jensen, Tobias Lindstrøm Jensen:
Algorithms and software for total variation image reconstruction via first-order methods. Numer. Algorithms 53(1): 67-92 (2010) - [c13]Martin S. Andersen, Lieven Vandenberghe, Joachim Dahl:
Linear matrix inequalities with chordal sparsity patterns and applications to robust quadratic optimization. CACSD 2010: 7-12 - [c12]Tobias Lindstrøm Jensen, Jan Østergaard, Joachim Dahl, Søren Holdt Jensen:
Multiple descriptions using sparse decompositions. EUSIPCO 2010: 110-114 - [p1]Jitkomut Songsiri, Joachim Dahl, Lieven Vandenberghe:
Graphical models of autoregressive processes. Convex Optimization in Signal Processing and Communications 2010: 89-116
2000 – 2009
- 2009
- [c11]Joachim Dahl, Jan Østergaard, Tobias Lindstrøm Jensen, Søren Holdt Jensen:
l1 Compression of Image Sequences Using the Structural Similarity Index Measure. DCC 2009: 133-142 - [c10]Johan Xi Zhang, Mads Græsbøll Christensen, Joachim Dahl, Søren Holdt Jensen, Marc Moonen:
Sub-band implementation of the Harmonic MUSIC algorithm. ICASSP 2009: 309-312 - [c9]Joachim Dahl, Jan Østergaard, Tobias Lindstrøm Jensen, Søren Holdt Jensen:
An efficient first-order method for l1 compression of images. ICASSP 2009: 1009-1012 - [c8]Jitkomut Songsiri, Joachim Dahl, Lieven Vandenberghe:
Maximum-likelihood estimation of autoregressive models with conditional independence constraints. ICASSP 2009: 1701-1704 - [c7]Johan Xi Zhang, Mads Græsbøll Christensen, Joachim Dahl, Søren Holdt Jensen, Marc Moonen:
Robust implementation of the MUSIC algorithm. ICASSP 2009: 3037-3040 - [c6]Daniele Giacobello, Mads Græsbøll Christensen, Joachim Dahl, Søren Holdt Jensen, Marc Moonen:
Joint estimation of short-term and long-term predictors in speech coders. ICASSP 2009: 4109-4112 - 2008
- [j3]Joachim Dahl, Lieven Vandenberghe, Vwani P. Roychowdhury:
Covariance selection for nonchordal graphs via chordal embedding. Optim. Methods Softw. 23(4): 501-520 (2008) - [j2]Megumi Kaneko, Petar Popovski, Joachim Dahl:
Proportional Fairness in Multi-Carrier System with Multi-Slot Frames: Upper Bound and User Multiplexing Algorithms. IEEE Trans. Wirel. Commun. 7(1): 22-26 (2008) - [c5]Daniele Giacobello, Mads Græsbøll Christensen, Joachim Dahl, Søren Holdt Jensen, Marc Moonen:
Sparse linear predictors for speech processing. INTERSPEECH 2008: 1353-1356 - [c4]Johan Xi Zhang, Mads Græsbøll Christensen, Joachim Dahl, Søren Holdt Jensen, Marc Moonen:
Frequency-domain parameter estimations for binary masked signals. INTERSPEECH 2008: 1357-1360 - 2007
- [c3]Joachim Dahl, Søren Holdt Jensen, Per Christian Hansen:
A Convex Programming Approach to Anisotropic Smoothing. ICIP (2) 2007: 101-104 - 2006
- [j1]Megumi Kaneko, Petar Popovski, Joachim Dahl:
Proportional fairness in multi-carrier system: upper bound and approximation algorithms. IEEE Commun. Lett. 10(6): 462-464 (2006) - 2003
- [c2]Joachim Dahl, Bernard H. Fleury, Lieven Vandenberghe:
Approximate maximum-likelihood estimation using semidefinite programming. ICASSP (6) 2003: 721-724 - [c1]Joachim Dahl, Bernard H. Fleury, Søren Holdt Jensen, Jakob Stoustrup:
Optimization of signature sequences and receiver filters for downlink DS-CDMA systems. ICC 2003: 3272-3276
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-04-25 05:44 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:
