default search action
Trond Steihaug
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j26]Trond Steihaug:
A Story of Computational Science: Colonel Titus' Problem from the 17th Century. Axioms 11(6): 287 (2022) - [i3]Trond Steihaug:
Fibonacci and digit-by-digit computation; An example of reverse engineering in computational mathematics. CoRR abs/2211.00504 (2022) - 2020
- [j25]Trond Steihaug:
Computational science in the eighteenth century. Test cases for the methods of Newton, Raphson, and Halley: 1685 to 1745. Numer. Algorithms 83(4): 1259-1275 (2020)
2010 – 2019
- 2019
- [i2]Trond Steihaug, D. G. Rogers:
Approximating cube roots of integers, after Heron's Metrica III.20. CoRR abs/1905.03547 (2019) - 2018
- [j24]Ute Schaarschmidt, Trond Steihaug, Sam Subbey:
A parametrized stock-recruitment relationship derived from a slow-fast population dynamic model. Math. Comput. Simul. 145: 171-185 (2018) - 2016
- [j23]Trond Steihaug, Sara Suleiman:
On the final steps of Newton and higher order methods. Optim. Lett. 10(2): 401-416 (2016) - 2015
- [c16]Ute Schaarschmidt, Trond Steihaug, Sam Subbey:
Derivative-Free Optimization for Population Dynamic Models. MCO (1) 2015: 391-402 - 2014
- [j22]Sanjay Kumar Khattri, Trond Steihaug:
Algorithm for forming derivative-free optimal methods. Numer. Algorithms 65(4): 809-824 (2014) - [j21]Mark A. Abramson, Lennart Frimannslund, Trond Steihaug:
A subclass of generating set search with convergence to second-order stationary points. Optim. Methods Softw. 29(5): 900-918 (2014) - 2013
- [j20]Shahadat Hossain, Trond Steihaug:
Graph models and their efficient implementation for sparse Jacobian matrix determination. Discret. Appl. Math. 161(12): 1747-1754 (2013) - [j19]Trond Steihaug, Sara Suleiman:
Global convergence and the Powell singular function. J. Glob. Optim. 56(3): 845-853 (2013) - [j18]Ørjan Bergmann, Trond Steihaug:
Solving trust-region subproblem augmented with linear inequality constraints. Optim. Methods Softw. 28(1): 26-36 (2013) - [j17]Marielba Rojas, Bjørn H. Fotland, Trond Steihaug:
Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem. Optim. Methods Softw. 28(3): 564-580 (2013) - [j16]Shahadat Hossain, Trond Steihaug:
Optimal direct determination of sparse Jacobian matrices. Optim. Methods Softw. 28(6): 1218-1232 (2013) - [c15]Trond Steihaug, Wenli Wang:
Adaptive Curve Tailoring. ISCIS 2013: 3-13 - 2012
- [j15]Laurent Hascoët, Shahadat Hossain, Trond Steihaug:
Structured computation in optimization and algorithmic differentiation. ACM Commun. Comput. Algebra 46(3/4): 94-95 (2012) - [j14]Mohamed El Ghami, Zine El-Abidine Guennoun, S. Bouali, Trond Steihaug:
Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. J. Comput. Appl. Math. 236(15): 3613-3623 (2012) - [j13]Geir Gundersen, Trond Steihaug:
On diagonally structured problems in unconstrained optimization using an inexact super Halley method. J. Comput. Appl. Math. 236(15): 3685-3695 (2012) - [j12]Geir Gundersen, Trond Steihaug:
Sparsity in higher order methods for unconstrained optimization. Optim. Methods Softw. 27(2): 275-294 (2012) - [c14]Trond Steihaug, Shahadat Hossain, Laurent Hascoët:
Structure in Optimization: Factorable Programming and Functions. ISCIS 2012: 449-458 - 2011
- [c13]Lennart Frimannslund, Trond Steihaug:
A Class of Methods Combining L-BFGS and Truncated Newton. ISCIS 2011: 565-570 - 2010
- [j11]Geir Gundersen, Trond Steihaug:
On large-scale unconstrained optimization problems and higher order methods. Optim. Methods Softw. 25(3): 337-358 (2010) - [j10]Mohamed El Ghami, Cornelis Roos, Trond Steihaug:
A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions. Optim. Methods Softw. 25(3): 387-403 (2010) - [j9]Mohamed El Ghami, Trond Steihaug:
Kernel-function Based Primal-Dual Algorithms for P * ( κ) Linear Complementarity Problems. RAIRO Oper. Res. 44(3): 185-205 (2010) - [c12]Shahadat Hossain, Trond Steihaug:
Graph Models and their Efficient Implementation for Sparse Jacobian Matrix Determination. CTW 2010: 91-96
2000 – 2009
- 2009
- [c11]Mohamed El Ghami, Ivan Ivanov, Trond Steihaug:
Primal-dual interior-point methods solver based on kernel functions for Linear Optimization. IMCSIT 2009: 743-749 - [i1]Shahadat Hossain, Trond Steihaug:
The CPR Method and Beyond : Prologue. Combinatorial Scientific Computing 2009 - 2008
- [j8]Shahadat Hossain, Trond Steihaug:
Graph coloring in the estimation of sparse derivative matrices: Instances and applications. Discret. Appl. Math. 156(2): 280-288 (2008) - [c10]Mohamed El Ghami, Ivan Ivanov, Hans Melissen, Cornelis Roos, Trond Steihaug:
Primal-dual algorithm for linear optimization problems based on a new class of kernel functions. ISCC 2008: 722-729 - 2007
- [j7]Lennart Frimannslund, Trond Steihaug:
A generating set search method using curvature information. Comput. Optim. Appl. 38(1): 105-121 (2007) - 2005
- [j6]Yasemin Yalçinkaya, Trond Steihaug:
Aggregating Variables for Asynchronous Iterations. Parallel Process. Lett. 15(1-2): 99-114 (2005) - [c9]Ørjan Bergmann, Arvid Lundervold, Trond Steihaug:
Generating a Synthetic Diffusion Tensor Dataset. CBMS 2005: 277-281 - [c8]Venansius Baryamureeba, Trond Steihaug:
On the Convergence of an Inexact Primal-Dual Interior Point Method for Linear Programming. LSSC 2005: 629-637 - 2004
- [j5]Geir Gundersen, Trond Steihaug:
Data structures in Java for matrix computations. Concurr. Pract. Exp. 16(8): 799-815 (2004) - [c7]Yasemin Yalçinkaya, Trond Steihaug:
Reducing the Deteriorating Effect of Old History in Asynchronous Iterations. Euro-Par 2004: 698-707 - 2003
- [c6]Geir Gundersen, Trond Steihaug:
On The Use of Java Arrays for Sparse Matrix Computations. PARCO 2003: 119-126 - 2002
- [c5]Shahadat Hossain, Trond Steihaug:
Sparsity issues in the computation of Jacobian matrices. ISSAC 2002: 123-130 - 2000
- [c4]Yasemin Yalçinkaya, Trond Steihaug:
An Analytical Model for a Class of Architectures under Master-Slave Paradigm. HPCN Europe 2000: 601-604
1990 – 1999
- 1999
- [c3]Venansius Baryamureeba, Trond Steihaug, Yin Zhang:
Application of a Class of Preconditioners to Large Scale Linear Programming Problems. Euro-Par 1999: 1044-1048 - [c2]Venansius Baryamureeba, Trond Steihaug:
Computational Issues for a New Class of Preconditioners. LSSC 1999: 128-135 - 1997
- [c1]Trond Steihaug, Yasemin Yalçinkaya:
Deteriorating Convergence for Asynchronous Methods on Linear Least Sqare Problems. Euro-Par 1997: 750-759
1980 – 1989
- 1985
- [j4]Ron S. Dembo, Trond Steihaug:
A Test Problem Generator for Large-Scale Unconstrained Optimization. ACM Trans. Math. Softw. 11(2): 97-102 (1985) - 1983
- [j3]Ron S. Dembo, Trond Steihaug:
Truncated-newtono algorithms for large-scale unconstrained optimization. Math. Program. 26(2): 190-212 (1983) - [j2]Trond Steihaug:
Local and superlinear convergence for truncated iterated projections methods. Math. Program. 27(2): 176-190 (1983) - 1982
- [j1]Trond Steihaug:
Practical methods of optimization volume 1 : Unconstrained optimization, by R. Flet-cher, Wiley, New York, 1980, 120 pp. Price: $24.50. Networks 12(4): 508-509 (1982)
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-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint