default search action
Roland Hildebrand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Sergey Bakhurin, Roland Hildebrand
, Mohammad S. Alkousa, Alexander A. Titov, Nikita Yudin:
Optimization in complex spaces with the mixed Newton method. J. Glob. Optim. 90(2): 373-399 (2024) - [j20]Anastasia Ivanova, Roland Hildebrand:
Optimal step length for the maximal decrease of a self-concordant function by the Newton method. Optim. Lett. 18(3): 847-854 (2024) - [i3]Nikita Yudin, Roland Hildebrand, Sergey Bakhurin, Alexander Degtyarev, Anna Lisachenko, Ilya A. Kuruzov, Andrei Semenov
Mixed Newton Method for Optimization in Complex Spaces. CoRR abs/2407.20367 (2024) - 2022
- [j19]Roland Hildebrand
Semi-definite Representations for Sets of Cubics on the Two-dimensional Sphere. J. Optim. Theory Appl. 195(2): 666-675 (2022) - [j18]Roland Hildebrand
Projectively Self-Concordant Barriers. Math. Oper. Res. 47(3): 2444-2463 (2022) - 2021
- [j17]Andrey Afonin, Roland Hildebrand
The extreme rays of the 6˟ 6 copositive cone. J. Glob. Optim. 79(1): 153-190 (2021) - [j16]Roland Hildebrand
Optimal step length for the Newton method: case of self-concordant functions. Math. Methods Oper. Res. 94(2): 253-279 (2021) - [i2]Evgeniya A. Vorontsova, Roland Hildebrand, Alexander V. Gasnikov, Fedor S. Stonyakin:
Convex optimization. CoRR abs/2106.01946 (2021) - 2020
- [j15]Roland Hildebrand
On the algebraic structure of the copositive cone. Optim. Lett. 14(8): 2007-2019 (2020)
2010 – 2019
- 2016
- [j14]Roland Hildebrand
Spectrahedral cones generated by rank 1 matrices. J. Glob. Optim. 64(2): 349-397 (2016) - 2015
- [j13]Roland Hildebrand
Closed-Loop Optimal Experiment Design: Solution via Moment Extension. IEEE Trans. Autom. Control. 60(7): 1731-1744 (2015) - 2014
- [j12]Roland Hildebrand
Canonical Barriers on Convex Cones. Math. Oper. Res. 39(3): 841-850 (2014) - 2013
- [j11]Roland Hildebrand
A lower bound on the barrier parameter of barriers for convex cones. Math. Program. 142(1-2): 311-329 (2013) - [j10]Peter J. C. Dickinson, Mirjam Dür, Luuk Gijben, Roland Hildebrand
Scaling relationship between the copositive cone and Parrilo's first level approximation. Optim. Lett. 7(8): 1669-1679 (2013) - [c9]Roland Hildebrand
Central extensions in closed-loop optimal experiment design. CDC 2013: 5822-5827 - [c8]Roland Hildebrand, Lev V. Lokutsievskiy
Generic fractal structure of the optimal synthesis in problems with affine multi-dimensional control. ECC 2013: 3197-3202 - [c7]Volker Lohweg
Banknote authentication with mobile devices. Media Watermarking, Security, and Forensics 2013: 866507 - 2011
- [j9]Xavier Bombois, Michel Gevers, Roland Hildebrand, Gabriel Solari:
Optimal experiment design for open and closed-loop system identification. Commun. Inf. Syst. 11(3): 197-224 (2011) - [c6]Cristian R. Rojas, Dimitrios Katselis, Håkan Hjalmarsson
Chance constrained input design. CDC/ECC 2011: 2957-2962 - 2010
- [c5]Roland Hildebrand
Closed-loop optimal experiment design: The partial correlation approach. CDC 2010: 2855-2862
2000 – 2009
- 2009
- [c4]Cristian R. Rojas, Håkan Hjalmarsson
MIMO experiment design based on asymptotic model order theory. CDC 2009: 488-493 - 2008
- [j8]Roland Hildebrand
Combinatorial laplacians and positivity under partial transpose. Math. Struct. Comput. Sci. 18(1): 205-219 (2008) - [c3]Roland Hildebrand
Optimal inputs for FIR system identification. CDC 2008: 5525-5530 - 2007
- [j7]Roland Hildebrand
Identification for control: Optimal input intended to identify a minimum variance controller. Autom. 43(5): 758-767 (2007) - 2006
- [j6]Xavier Bombois, Gérard Scorletti, Michel Gevers, Paul M. J. Van den Hof
Least costly identification experiment for control. Autom. 42(10): 1651-1662 (2006) - [i1]Roland Hildebrand, Stefano Mancini, Simone Severini:
Combinatorial laplacians and positivity under partial transpose. CoRR abs/cs/0607036 (2006) - 2005
- [j5]Roland Hildebrand
Asymptotic Accuracy of Iterative Feedback Tuning. IEEE Trans. Autom. Control. 50(8): 1182-1185 (2005) - [j4]Roland Hildebrand
Optimal Prefiltering in Iterative Feedback Tuning. IEEE Trans. Autom. Control. 50(8): 1196-1200 (2005) - 2004
- [j3]Roland Hildebrand
Quantification of the variance of estimated transfer functions in the presence of undermodeling. IEEE Trans. Autom. Control. 49(8): 1345-1350 (2004) - [j2]Roland Hildebrand
Prefiltering in iterative feedback tuning: optimization of the prefilter for accuracy. IEEE Trans. Autom. Control. 49(10): 1801-1806 (2004) - 2003
- [c2]Roland Hildebrand
Identification for control: optimal input design with respect to a worst-case ν-gap cost function. CDC 2003: 996-1001 - [c1]Roland Hildebrand, Andrea Lecchini, Gabriel Solari, Michel Gevers:
Optimization of the prefilter in iterative feedback tuning for improved accuracy of the controller parameter update. CDC 2003: 4422-4427 - 2002
- [j1]Roland Hildebrand
Identification For Control: Optimal Input Design With Respect To A Worst-Case $\nu$-gap Cost Function. SIAM J. Control. Optim. 41(5): 1586-1608 (2002)
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-08 20:32 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: