Home
Trond Steihaug's picture

Trond Steihaug

Professor, Optimization
  • E-mailTrond.Steihaug@uib.no
  • Phone+47 55 58 41 69+47 995 99 657
  • Visitor Address
    HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • 2019. Surrogate-based model parameter optimization based on gas explosion experimental data. Engineering optimization (Print). 301-316.
  • 2019. Primal-dual algorithms for semidifinite optimization problems based on Kernel-function with trigonometric barrier term. International Journal of Applied Mathematics (IJAM). 333-356.
  • 2019. Computational science in the eighteenth century. Test cases for the methods of Newton, Raphson, and Halley: 1685 to 1745. Numerical Algorithms. 1-17.
  • 2018. A review of termination rules of an inexact primal-dual interior point method for linear programming problems. Investigacion Operacional. 480-494.
  • 2018. A parametrized stock-recruitment relationship derived from a slow-fast population dynamic model. Mathematics and Computers in Simulation. 171-185.
  • 2017. A New Parametric Kernel Function with trigonometric barrier term for convex quadratic symmetric cone optimization. Applied Analysis and Optimization. 19-44.
  • 2017. A New Parametric Kernel Function Yielding the Best Known Iteration Bonds of Interior Point Methods for the Cartesian P∗(κ)-SCLCP. Pacific Journal of Optimization. 547-570.
  • 2016. On the final steps of Newton and higher order methods. Optimization Letters. 401-416.
  • 2015. Derivative-free optimization for population dynamic models. Advances in Intelligent Systems and Computing. 391-402.
  • 2014. Algorithm for forming derivative-free optimal methods. Numerical Algorithms. 809-824.
  • 2014. A subclass of generating set search with convergence to second-order stationary points. Optimization Methods and Software. 900-918.
  • 2013. Sparse matrix computations with application to solving system of nonlinear equations. Wiley Interdisciplinary Reviews: Computational Statistics. 372-386.
  • 2013. Solving trust-region subproblem augmented with linear inequality constraints. Optimization Methods and Software. 26-36.
  • 2013. Rate of convergence of higher order methods. Applied Numerical Mathematics. 230-242.
  • 2013. Optimal direct determination of sparse Jacobian matrices. Optimization Methods and Software. 1218-1232.
  • 2013. Graph models and their efficient implementation for sparse Jacobian matrix determination. Discrete Applied Mathematics. 1747-1754.
  • 2013. Global convergence and the Powell singular function. Journal of Global Optimization. 845-853.
  • 2013. Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem. Optimization Methods and Software. 564-580.
  • 2013. Approximating cube roots of integers, after Heron’s Metrica III.20. Normat. 87-110.
  • 2012. Sparsity in higher order methods for unconstrained optimization. Optimization Methods and Software. 275-294.
  • 2012. On diagonally structured problems in unconstrained optimization using an inexact super Halley method. Journal of Computational and Applied Mathematics. 3685-3695.
  • 2012. Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. Journal of Computational and Applied Mathematics. 3613-3623.
  • 2011. Solving trust-region subproblem augmented with linear inequality constraints. Optimization Methods and Software. 11 pages.
  • 2011. Rate of convergence of higher order methods. Applied Numerical Mathematics. 13 pages.
  • 2011. On a New Method for Derivative Free Optimization. International Journal On Advances in Software. 244-255.
  • 2010. On large-scale unconstrained optimization problems and higher order methods. Optimization Methods and Software. 337-358.
  • 2010. Kernel-function Based Primal-Dual Algorithms for P*(κ) Linear Complementarity Problems. Reserche operationelle. 185-205.
  • 2010. A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions. Optimization Methods and Software. 387-403.
  • 2009. The CPR Method and Beyond : Prologue. Dagstuhl Seminar Proceedings. 3 pages.
  • 2009. Primal-dual interior-point methods solver based on kernel functions for Linear Optimization. International Multiconference on Computer Science and Information Technology. 743-749.
  • 2009. Interior Point Methods for Self-Dual Linear Optimization Problems Based on Kernel Functions. Mathematica Balkanica. 229-248.
  • 2009. A polynomial-time algorithm for linear optimization based on a new class of kernel functions. Journal of Computational and Applied Mathematics. 500-513.
  • 2008. Primal-Dual Algorithm for Linear Optimization Problems Based on a New Class of Kernel Functions. Proceedings of the IEEE Symposium on Computers and Communications. 722-729.
  • 2008. Halley and Newton are one step apart. Proceedings in Applied Mathematics and Mechanics : PAMM. 2060011-2060012.
  • 2008. Graph coloring in the estimation of sparse derivative matrices: Instances and applications. Discrete Applied Mathematics. 280-288.
  • 2008. A polynomial-time algorithm for LO based on generalized logarithmic barrier functions. International Journal of Applied Mathematics (IJAM). 99-115.
  • 2007. Sparsity of the average curvature information matrix. Proceedings in Applied Mathematics and Mechanics : PAMM. 1062101-1062102.
  • 2007. Properties of Preconditioners for Robust Linear Regression. International Journal of Computing and ICT Research. 50-66.
  • 2007. A generating set search method using curvature information. Computational optimization and applications. 105-121.
  • 2006. On the Convergence of an Inexact Primal-Dual Interior Point Method for Linear Programming. Lecture Notes in Computer Science (LNCS). 629 -637.
  • 2005. Aggregating variables for asynchronous iterations. Parallel Processing Letters. 99-114.
  • 2004. Reducing the deteriorating effect of old history in asynchronous iterations. Lecture Notes in Computer Science (LNCS). 698-707.
  • 2004. Data Structures in Java for Matrix Computations. Concurrency and Computation. 1-10.
  • 2002. An interior point trust-region based method for large scale nonnegative regularization. Inverse Problems. 1291-1307.
  • 1997. Deteriorating Convergence for Asynchronous Methods on Linear Least Squares Problem. Lecture Notes in Computer Science (LNCS). 750-759.
Report
  • 2014. Application of slow-fast population dynamic models. .
  • 2006. Using Partial Separability of Functions in Generating Set Search Methods for Unconstrained Optimisation. .
  • 2006. Primal-Dual IPMS for Semidefinite Optimization Based on Finite Barrier Functions. .
  • 2006. A class of Methods Combining L-BFGS and Truncated Newton. .
  • 2003. Optimal Direct Determination of Sparse Jacobian Matrices. 254. 254. .
  • 2000. On the Properties of Preconditioners for Robust Linear Regression. .
  • 2000. On the Convergence of an Inexact Primal-Dual Interior Point Method for Linear Programming. .
  • 1999. Properties of a Class of Preconditioners for Weighted Least Squares Problems. 170. 170. .
  • 1999. Properties and computational issues of a preconditioner for interior point methods. .
  • 1999. Properties and Computational Issues of a Preconditioner for Interior Point Methods. .
  • 1998. On componentwise convergence. CRPC-TR. CRPC-TR. .
  • 1998. A Ferris-Mangasarian technique applied to linear least squares problems. 150. 150. .
  • 1998. A Ferris-Mangasarian Technique Applied to Linear Least Squares Problems. CRPC-TR. CRPC-TR. .
  • 1997. Graph coloring and the estimation of sparse Jacobian matrices with segmented columns. .
  • 1997. Asynchronous Methods and Least Squares: An Example of Deteriorating Convergence. 131. 131. .
  • 1996. Curve Tailoring. .
  • 1992. Graph coloring and the estimation of sparse jacobian matrices using row and column partitioning. .
Lecture
  • 2015. Structural uncertainty in population dynamic models .
Popular scientific lecture
  • 1994. Implementasjon av en trunkert indre punkt metode.
  • 1994. A truncated interior point method.
Academic lecture
  • 2015. Derivative-Free Optimization for Population Dynamic Models.
  • 2014. A Stock-recruitment Relationship Derived from a Slow-fast Population Dynamic Model .
  • 2014. A Stock-recruitment Relationship Derived from a Slow-fast Population Dynamic Model.
  • 2013. Curvilinear search and higher order methods.
  • 2011. Sparse Matrix Structures and Higher Derivatives.
  • 2011. Rate of Convergence of Higher Order Methods.
  • 2011. Higher Order Methods for Nonlinear System of Equations and Unconstrained Optimization.
  • 2011. Factorable programming revisited.
  • 2010. Higher Order Methods for Solving Systems of Nonlinear Equations.
  • 2010. Higher Order Methods.
  • 2010. Graph Models and their Efficient Implementation for Sparse Jacobian Matrix Determination.
  • 2010. Global Convergence and the Powell Singular Function.
  • 2010. Global Convergence and the Powell Singular Function.
  • 2009. When Halley and Newton are one step apart .....
  • 2009. Generating Set Search with Convergence to Second-order Stationary Points and the Impact of Sparsity.
  • 2008. Primal-Dual Algorithm for Linear Optimization Problems Based on a New Class of Kernel Functions.
  • 2007. Primal-dual Interior-point Algorithm for Conic Optimization Based on Kernel Functions.
  • 2007. Primal-Dual IPMs for a Class of Linear Complementarity Problems Based on Kernel Functions.
  • 2007. Primal-Dual IPMS for semidefinite optimization based on finite barrier functions.
  • 2007. Flow Models in Pipeline Transportation Networks for Natural Gas.
  • 2007. Derivative Free Optimization and Average Curvature Information.
  • 2007. A Generic Primal-dual Interior-point Algorithm for Cone Optimization Based on Kernel Functions.
  • 2006. The CPR and Beyond.
  • 2006. Sparsity in Higher Order Methods in Optimization.
  • 2006. Separability and Sufficient Decrease in Generating Set Search Methods.
  • 2006. On computing with general sparse third derivatives in unconstrained optimization.
  • 2006. Newton and Halley are one step apart.
  • 2006. Cubically convergent methods are no more expensive (almost) than Newton's method.
  • 2004. Computing a sparse Jacobian by elimination, substitution or direct method: What is the difference?
  • 2004. A new Generating Set Search Method for Unconstrained Optimisation.
  • 2004. A Generating Set Search Method Exploiting Curvature and Sparsity.
  • 2003. When Sparsity Counts: Optimal Direct Jacobian Computation.
  • 2003. On The Use of Java Arrays for Sparse Matrix Computations.
  • 2003. Graph Coloring in the Estimation of Mathematical Derivatives.
  • 2003. Discrete event simulation and rodent navigaton.
  • 2003. Discrete event simulation and rodent navigation.
  • 2002. Sparsity issues in the computation of Jacobian Matrices.
  • 2002. Large-Scale Optimization Techniques for Nonnegative Image Restorations.
  • 2002. Indirect Methods For Computing Sparse Jacobian Matrices.
  • 2002. Higher order methods and the quest for order.
  • 2002. Graph coloring in the estimation of mathematical derivatives.
  • 2002. Data Structures in Java for Matrix Computations.
  • 2002. An interior point trust-region based method for large scale nonnegative regularization. nr. TR/PA/01/11.
  • 2002. An Interior-Point Trust-Region-Based Method for Large-Scale Nonnegative Regularization.
  • 2001. When sparsity counts: Computing derivatives in optimization.
  • 2001. Computational Issues for a Low Rank Correction of a Factored Preconditioner.
  • 2000. Reducing the number of AD passes for computing a partitioned sparse Jacobian matrix.
  • 2000. Preconditioning for Iterative Methods in Robust Linear Regression.
  • 2000. Convergence of Inexact Primal-Dual Methods for Linear Optimization.
  • 2000. Convergence of Inexact Primal-Dual Methods for Linear Optimization.
  • 2000. An analytical model for a class of architectures under master-slave paradigm.
  • 2000. An analytical model for a class of architectures under master-slave paradigm.
  • 1999. On a class of preconditioners for interior point methods.
  • 1999. Gauss-Newton method on mildly nonlinear problems and a class of preconditioners for the normal equation for weighted linear least squares problems.
  • 1999. Computational issues for a new class of preconditioners.
  • 1999. Are three parameters enough to represent a parallel computer?
  • 1999. Application of a new class of preconditioners to large-scale linear programming problems.
  • 1999. Application of a class of preconditioners to large-scale linear programming problems.
  • 1997. Asynchronous Methods and Least Squares: An Example of Deteriorating Convergence.
  • 1997. Asymptotic analysis of interior point methods: Deteriorating Convergence for Asynchronous Methods on Linear Least Squares Problems.
  • 1994. To rank a Miss without to miss a Rank.
Academic anthology/Conference proceedings
  • 2005. Computing Sparse Jacobian Matrices Optimally. Springer.
Thesis at a second degree level
  • 2003. Discrete event simulation in Java with applications in rodent navigation.
Popular scientific article
  • 2009. A minimum requiring angle trisection. Normat. 78-89.
Doctoral dissertation
  • 2019. Parameter optimisation for the improved modelling of industrial-scale gas explosions.
  • 2018. Multiple time–scale dynamics of stage structured populations and derivative–free optimization.
  • 2006. On Curvature and Separability in Unconstrained Optimisation.
Academic chapter/article/Conference paper
  • 2013. Structure in Optimization: Factorable Programming and Functions. 10 pages.
  • 2013. Adaptive Curve Tailoring. 11 pages.
  • 2011. A Class of Methods Combining L-BFGS and Truncated Newton. 6 pages.
  • 2010. Rate of Convergence of Higher Order Methods. 6 pages.
  • 2010. A New Generating Set Search Algorithm for Partially Separable Functions. 6 pages.
  • 2009. An Implementation of Interior-Point Methods Based on Kernel Functions for Linear Optimization. 12 pages.
  • 2007. Primal-Dual IPMS for semidefinite optimization based on finite barrier functions. 14 pages.
  • 2006. On computing with general sparse third derivatives in unconstrained optimization. 12 pages.
  • 2005. Generating a Synthetic Diffusion Tensor Dataset. 5 pages.
  • 2004. On The Use of Java Arrays for Sparse Matrix Computations. 8 pages.
  • 1996. Computing a sparse Jacobian matrix by rows and columns.
Other
  • 2012. Structure in optimization. 89-90.
Abstract
  • 2013. Structured computation in optimization and Algorithmic Differentiation. ACM Communications in Computer Algebra. 94-95.
Poster
  • 2013. Curvilinear search and higher order methods.

More information in national current research information system (CRIStin)