default search action
Jos F. Sturm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [j15]Frank Lutgens, Jos F. Sturm, Antoon W. J. Kolen:
Robust One-Period Option Hedging. Oper. Res. 54(6): 1051-1062 (2006) - 2004
- [j14]Zhi-Quan Luo, Jos F. Sturm, Shuzhong Zhang:
Multivariate Nonnegative Quadratic Mappings. SIAM J. Optim. 14(4): 1140-1162 (2004) - 2003
- [j13]Jos F. Sturm, Shuzhong Zhang:
On Cones of Nonnegative Quadratic Functions. Math. Oper. Res. 28(2): 246-267 (2003) - [j12]Jos F. Sturm:
Avoiding numerical cancellation in the interior point method for solving semidefinite programs. Math. Program. 95(2): 219-247 (2003) - 2002
- [j11]Jos F. Sturm:
Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optim. Methods Softw. 17(6): 1105-1154 (2002) - [j10]Timothy N. Davidson
, Zhi-Quan Luo, Jos F. Sturm:
Linear matrix inequality formulation of spectral mask constraints with applications to FIR filter design. IEEE Trans. Signal Process. 50(11): 2702-2715 (2002) - 2001
- [j9]Jos F. Sturm, Shuzhong Zhang:
On sensitivity of central solutions in semidefinite programming. Math. Program. 90(2): 205-227 (2001) - [c1]Timothy N. Davidson, Zhi-Quan Luo, Jos F. Sturm:
Linear matrix inequality formulation of spectral mask constraints. ICASSP 2001: 3813-3816 - 2000
- [j8]Jos F. Sturm, Shuzhong Zhang:
On weighted centers for semidefinite programming. Eur. J. Oper. Res. 126(2): 391-407 (2000) - [j7]Jos F. Sturm:
Error Bounds for Linear Matrix Inequalities. SIAM J. Optim. 10(4): 1228-1248 (2000)
1990 – 1999
- 1998
- [j6]Jos F. Sturm, Shuzhong Zhang:
An interior point method, based on rank-1 updates, for linear programming. Math. Program. 81: 77-87 (1998) - [j5]Jos F. Sturm, Shuzhong Zhang:
On the long-step path-following method for semidefinite programming. Oper. Res. Lett. 22(4-5): 145-150 (1998) - [j4]Zhi-Quan Luo, Jos F. Sturm, Shuzhong Zhang:
Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming. SIAM J. Optim. 8(1): 59-81 (1998) - 1997
- [j3]Jos F. Sturm, Shuzhong Zhang:
On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming. Math. Oper. Res. 22(2): 408-431 (1997) - 1996
- [j2]Jos F. Sturm, Shuzhong Zhang:
New complexity results for the Iri-Imai method. Ann. Oper. Res. 62(1): 539-564 (1996) - [j1]Jos F. Sturm, Shuzhong Zhang:
An O(root(n)L) iteration bound primal-dual cone affine scaling algorithm for linear programming. Math. Program. 72: 177-194 (1996)
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:55 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: