liu.seSearch for publications in DiVA
Endre søk
Begrens søket
1234567 51 - 100 of 572
Referera
Referensformat
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• oxford
• Annet format
Fler format
Språk
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Annet språk
Fler språk
Utmatningsformat
• html
• text
• asciidoc
• rtf
Treff pr side
• 5
• 10
• 20
• 50
• 100
• 250
Sortering
• Standard (Relevans)
• Forfatter A-Ø
• Forfatter Ø-A
• Tittel A-Ø
• Tittel Ø-A
• Type publikasjon A-Ø
• Type publikasjon Ø-A
• Eldste først
• Nyeste først
• Disputationsdatum (tidligste først)
• Disputationsdatum (siste først)
• Standard (Relevans)
• Forfatter A-Ø
• Forfatter Ø-A
• Tittel A-Ø
• Tittel Ø-A
• Type publikasjon A-Ø
• Type publikasjon Ø-A
• Eldste først
• Nyeste først
• Disputationsdatum (tidligste først)
• Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
• 51.
Numerical Solution of the Cauchy Problem for the Helmholtz Equation2014Rapport (Annet vitenskapelig)

The Cauchy problem for the Helmholtz equation appears in applications related to acoustic or electromagnetic wave phenomena. The problem is ill–posed in the sense that the solution does not depend on the data in a stable way. In this paper we give a detailed study of the problem. Specifically we investigate how the ill–posedness depends on the shape of the computational domain and also on the wave number. Furthermore, we give an overview over standard techniques for dealing with ill–posed problems and apply them to the problem.

Fulltekst (pdf)
Numerical Solution of the Cauchy Problem for the Helmholtz Equation
• 52.
Iterative Tikhonov regularization for the Cauchy problem for the Helmholtz equation2017Inngår i: Computers and Mathematics with Applications, ISSN 0898-1221, E-ISSN 1873-7668, Vol. 73, nr 1, s. 163-172Artikkel i tidsskrift (Fagfellevurdert)

Fulltekst (pdf)
fulltext
• 53.
Robin-Dirichlet algorithms for the Cauchy problem for the Helmholtz equation2018Inngår i: Inverse Problems in Science and Engineering, ISSN 1741-5977, E-ISSN 1741-5985, Vol. 26, nr 7, s. 1062-1078Artikkel i tidsskrift (Fagfellevurdert)

The Cauchy problem for the Helmholtz equation is considered. It was demonstrated in a previous paper by the authors that the alternating algorithm suggested by V.A. Kozlov and V.G. Mazya does not converge for large wavenumbers k in the Helmholtz equation. Here, we present some simple modifications of the algorithm which may restore the convergence. They consist of the replacement of the Neumann-Dirichlet iterations by the Robin-Dirichlet ones which repairs the convergence for less than the first Dirichlet-Laplacian eigenvalue. In order to treat large wavenumbers, we present an algorithm based on iterative solution of Robin-Dirichlet boundary value problems in a sufficiently narrow border strip. Numerical implementations obtained using the finite difference method are presented. The numerical results illustrate that the algorithms suggested in this paper, produce convergent iterative sequences.

• 54.
Solvability of a non-linear Cauchy problem for an elliptic equation2019Inngår i: International Journal of Computer Mathematics, ISSN 0020-7160, E-ISSN 1029-0265, Vol. 96, nr 12, s. 2317-2333Artikkel i tidsskrift (Fagfellevurdert)

We study a non-linear operator equation originating from a Cauchy problem for an elliptic equation. The problem appears in applications where surface measurements are used to calculate the temperature below the earth surface. The Cauchy problem is ill-posed and small perturbations to the used data can result in large changes in the solution. Since the problem is non-linear certain assumptions on the coefficients are needed. We reformulate the problem as an non-linear operator equation and show that under suitable assumptions the operator is well-defined. The proof is based on making a change of variables and removing the non-linearity from the leading term of the equation. As a part of the proof we obtain an iterative procedure that is convergent and can be used for evaluating the operator. Numerical results show that the proposed procedure converges faster than a simple fixed point iteration for the equation in the the original variables.

Fulltekst (pdf)
fulltext
• 55.
National University of Rwanda, Box 117, Butare, Rwanda.
A Data Assimilation Approach to Coefficient Identification2011Rapport (Annet vitenskapelig)

The thermal conductivity properties of a material can be determined experimentally by using temperature measurements taken at specified locations inside the material. We examine a situation where the properties of a (previously known) material changed locally. Mathematically we aim to find the coefficient k(x) in the stationary heat equation (kTx)x = 0;under the assumption that the function k(x) can be parametrized using only a few degrees of freedom.

The coefficient identification problem is solved using a least squares approach; where the (non-linear) control functional is weighted according to the distribution of the measurement locations. Though we only discuss the 1D case the ideas extend naturally to 2D or 3D. Experimentsdemonstrate that the proposed method works well.

Fulltekst (pdf)
FULLTEXT01
• 56.
Error Estimation for Eigenvalues of Unbounded Linear Operators and an Application to Energy Levels in Graphene Quantum Dots2017Inngår i: Numerical Functional Analysis and Optimization, ISSN 0163-0563, E-ISSN 1532-2467, Vol. 38, nr 3, s. 293-305Artikkel i tidsskrift (Fagfellevurdert)

The eigenvalue problem for linear differential operators is important since eigenvalues correspond to the possible energy levels of a physical system. It is also important to have good estimates of the error in the computed eigenvalues. In this work, we use spline interpolation to construct approximate eigenfunctions of a linear operator using the corresponding eigenvectors of a discretized approximation of the operator. We show that an error estimate for the approximate eigenvalues can be obtained by evaluating the residual for an approximate eigenpair. The interpolation scheme is selected in such a way that the residual can be evaluated analytically. To demonstrate that the method gives useful error bounds, we apply it to a problem originating from the study of graphene quantum dots where the goal was to investigate the change in the spectrum from incorporating electronâelectron interactions in the potential.

Fulltekst (pdf)
fulltext
• 57.
Numerical methods in matrix computations2014 (oppl. 1)Bok (Fagfellevurdert)
• 58.
Saab AB, Sweden.
A constraint generation procedure for pre-runtime scheduling of integrated modular avionic systems2017Inngår i: Proceedings of the 13th Workshop on Models and Algorithms for Planning and Scheduling Problems / [ed] Susanne Albers, Nicole Megow, Andreas S. Schulz, Leen Stougie, 2017Konferansepaper (Annet vitenskapelig)

In modern integrated modular avionic systems, applications share hardware resources on a common avionic platform. Such an architecture necessitates strict requirements on the spatial and temporal partitioning of the system to prevent fault propagation between different aircraft functions. One way to establish a temporal partitioning is through pre-runtime scheduling of the system, which involves creating a schedule for both tasks and a communication network.

While the avionic systems are growing more and more complex, so is the challenge of scheduling them. Scheduling of the system has an important role in the development of new avionic systems since functionality typically is added to the system over a period of several years and a scheduling tool is used both to detect if the platform can host the new functionality and, in case this is possible, to create a new schedule. For this reason an exact solution strategy for avionics scheduling is preferred over a heuristic one.

In this paper we present a mathematical model for an industrially relevant avionic system and present a constraint generation  procedure for scheduling of such systems. We apply our optimisation approach to instances provided by our industrial partner. These instances are of relevance for the development of future avionic systems and contain up to 20 000 tasks to be scheduled. The computational results show that our optimisation approach can be used to create schedules for such instances within reasonable time.

• 59.
Saab AB, Sweden.
An Optimisation Approach for Pre-Runtime Scheduling of Tasks and Communication in an Integrated Modular Avionic System2017Rapport (Annet vitenskapelig)

In modern integrated modular avionic systems, applications share hardware resources on a common avionic platform. Such an architecture necessitates strict requirements on the spatial and temporal partitioning of the system to prevent fault propagation between different aircraft functions. One way to establish a temporal partitioning is through pre-runtime scheduling of the system, which involves creating a schedule for both tasks and a communication network.

While the avionic systems are growing more and more complex, so is the challenge of scheduling them. Scheduling of the system has an important role in the development of new avionic systems since functionality typically is added to the system over a period of several years and a scheduling tool is used both to detect if the platform can host the new functionality and, in case this is possible, to create a new schedule. For this reason an exact solution strategy for avionics scheduling is preferred over a heuristic one.

In this paper we present a mathematical model for an industrially relevant avionic system and present a constraint generation  procedure for scheduling of such systems. We apply our optimisation approach to instances provided by our industrial partner. These instances are of relevance for the development of future avionic systems and contain up to 20 000 tasks to be scheduled. The computational results show that our optimisation approach can be used to create schedules for such instances within reasonable time.

Fulltekst (pdf)
fulltext
• 60.
Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Produktionsekonomi. Linköpings universitet, Tekniska fakulteten.
Measurement of interest rates using a convex optimization model2017Inngår i: European Journal of Operational Research, ISSN 0377-2217, E-ISSN 1872-6860, Vol. 256, nr 1, s. 308-316Artikkel i tidsskrift (Fagfellevurdert)

Measurement of a single interest rate curve is an important and well-studied inverse problem. To select plausible interest rate curves from the infinite set of possible interest rate curves, forward rates should be used in the regularization. By discretizing the interest rate curve it is shown that the inverse problem can be reformulated as a convex optimization model that can be efficiently solved using existing solvers. The convex optimization model can include bills, bonds, certificates of deposits, forward rate agreements and interest rate swaps using both equality constraints and inequality constraints that stem from bid/ask prices. The importance of an appropriate regularization and allowing for deviations from market prices to obtain stable forward rate curves is illustrated using market data. (C) 2016 Elsevier B.V. All rights reserved.

• 61.
University of Cologne, Cologne, Germany.
University of Cologne, Cologne, Germany. Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska fakulteten. University of Cologne, Cologne, Germany. San Diego State University, San Diego, USA.
Multi-element SIAC Filter for Shock Capturing Applied to High-Order Discontinuous Galerkin Spectral Element Methods2019Inngår i: Journal of Scientific Computing, ISSN 0885-7474, E-ISSN 1573-7691, ISSN 0885-7474, Vol. 81, nr 2, s. 820-844Artikkel i tidsskrift (Fagfellevurdert)

We build a multi-element variant of the smoothness increasing accuracy conserving (SIAC) shock capturing technique proposed for single element spectral methods by Wissink et al. (J Sci Comput 77:579–596, 2018). In particular, the baseline scheme of our method is the nodal discontinuous Galerkin spectral element method (DGSEM) for approximating the solution of systems of conservation laws. It is well known that high-order methods generate spurious oscillations near discontinuities which can develop in the solution for nonlinear problems, even when the initial data is smooth. We propose a novel multi-element SIAC filtering technique applied to the DGSEM as a shock capturing method. We design the SIAC filtering such that the numerical scheme remains high-order accurate and that the shock capturing is applied adaptively throughout the domain. The shock capturing method is derived for general systems of conservation laws. We apply the novel SIAC filter to the two-dimensional Euler and ideal magnetohydrodynamics equations to several standard test problems with a variety of boundary conditions.

Fulltekst (pdf)
fulltext
• 62.
Mathematisches Institut, Universität zu Köln, Köln, Germany.
Mathematisches Institut, Universität zu Köln, Köln, Germany. Mathematisches Institut, Universität zu Köln, Köln, Germany. I. Physikalisches Institut, Universität zu Köln, Köln, Germany. Max-Planck Institut für Plasmaphysik, Garching, Germany. Institut für Geophysik und Meteorologie, Universität zu Köln, Köln, Germany.
An entropy stable nodal discontinuous Galerkin method for the resistive MHD equations. Part I: Theory and numerical verification2018Inngår i: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716Artikkel i tidsskrift (Fagfellevurdert)

The first paper of this series presents a discretely entropy stable discontinuous Galerkin (DG) method for the resistive magnetohydrodynamics (MHD) equations on three-dimensional curvilinear unstructured hexahedral meshes. Compared to other fluid dynamics systems such as the shallow water equations or the compressible Navier-Stokes equations, the resistive MHD equations need special considerations because of the divergence-free constraint on the magnetic field. For instance, it is well known that for the symmetrization of the ideal MHD system as well as the continuous entropy analysis a non-conservative term proportional to the divergence of the magnetic field, typically referred to as the Powell term, must be included. As a consequence, the mimicry of the continuous entropy analysis in the discrete sense demands a suitable DG approximation of the non-conservative terms in addition to the ideal MHD terms.

This paper focuses on the resistive MHD equations: Our first contribution is a proof that the resistive terms are symmetric and positive-definite when formulated in entropy space as gradients of the entropy variables, which enables us to show that the entropy inequality holds for the resistive MHD equations. This continuous analysis is the key for our DG discretization and guides the path for the construction of an approximation that discretely mimics the entropy inequality, typically termed entropy stability. Our second contribution is a detailed derivation and analysis of the discretization on three-dimensional curvilinear meshes. The discrete analysis relies on the summation-by-parts property, which is satisfied by the DG spectral element method (DGSEM) with Legendre-Gauss-Lobatto (LGL) nodes. Although the divergence-free constraint is included in the non-conservative terms, the resulting method has no particular treatment of the magnetic field divergence errors, which might pollute the solution quality. Our final contribution is the extension of the standard resistive MHD equations and our DG approximation with a divergence cleaning mechanism that is based on a generalized Lagrange multiplier (GLM).

As a conclusion to the first part of this series, we provide detailed numerical validations of our DGSEM method that underline our theoretical derivations. In addition, we show a numerical example where the entropy stable DGSEM demonstrates increased robustness compared to the standard DGSEM.

Fulltekst (pdf)
An entropy stable nodal discontinuous Galerkin method for the resistive MHD equations. Part I: Theory and numerical verification
• 63.
An Optimization-Based Approach to the Funding of a Loan Portfolio2004Independent thesis Basic level (professional degree)Oppgave

This thesis grew out of a problem encountered by a subsidiary of a Swedish multinational industrial corporation. This subsidiary is responsible for the corporation’s customer financing activities. In the thesis, we refer to these entities as the Division and the Corporation. The Division needed to find a new approach to finance its customer loan portfolio. Risk control and return maximization were important aspects of this need. The objective of this thesis is to devise and implement a method that allows the Division to make optimal funding decisions, given a certain risk limit.

We propose a funding approach based on stochastic programming. Our approach allows the Division’s portfolio manager to minimize the funding costs while hedging against market risk. We employ principal component analysis and Monte Carlo simulation to develop a multicurrency scenario generation model for interest and exchange rates. Market rate scenarios are used as input to three different optimization models. Each of the optimization models presents the optimal funding decision as positions in a unique set of financial instruments. By choosing between the optimization models, the portfolio manager can decide which financial instruments he wants to use to fund the loan portfolio.

To validate our models, we perform empirical tests on historical market data. Our results show that our optimization models have the potential to deliver sound and profitable funding decisions. In particular, we conclude that the utilization of one of our optimization models would have resulted in an increase in the Division’s net income over the past 3.5 years.

Fulltekst (pdf)
FULLTEXT01
• 64.
University of California, Merced, CA, USA.
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska fakulteten. Wake Forest University, Winston-Salem, NC, USA. University of California, Merced, CA, USA.
A dense initialization for limited-memory quasi-Newton methods2019Inngår i: Computational Optimization and Applications, ISSN 0926-6003, Vol. 74, nr 1, s. 121-142Artikkel i tidsskrift (Annet vitenskapelig)

We consider a family of dense initializations for limited-memory quasi-Newton methods. The proposed initialization exploits an eigendecomposition-based separation of the full space into two complementary subspaces, assigning a different initialization parameter to each subspace. This family of dense initializations is proposed in the context of a limited-memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) trust-region method that makes use of a shape-changing norm to define each subproblem. As with L-BFGS methods that traditionally use diagonal initialization, the dense initialization and the sequence of generated quasi-Newton matrices are never explicitly formed. Numerical experiments on the CUTEst test set suggest that this initialization together with the shape-changing trust-region method outperforms other L-BFGS methods for solving general nonconvex unconstrained optimization problems. While this dense initialization is proposed in the context of a special trust-region method, it has broad applications for more general quasi-Newton trust-region and line search methods. In fact, this initialization is suitable for use with any quasi-Newton update that admits a compact representation and, in particular, any member of the Broyden class of updates.

Fulltekst (pdf)
A dense initialization for limited-memory quasi-Newton methods
• 65.
Applied Mathematics, University of California, Merced, USA.
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska fakulteten. Department of Mathematics, Wake Forest University, USA. Applied Mathematics, University of California, Merced, USA. State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing, AMSS, CAS, Beijing, China.
Shape-Changing L-SR1 Trust-Region Methods2016Rapport (Annet vitenskapelig)

In this article, we propose a method for solving the trust-region subproblem when a limited-memory symmetric rank-one matrix is used in place of the true Hessian matrix. The method takes advantage of two shape-changing norms to decompose the trust-region subproblem into two separate problems, one of which has a closed-form solution and the other one is easy to solve. Sufficient conditions for global solutions to both subproblems are given. The proposed solver makes use of the structure of limited-memory symmetric rank-one matrices to find solutions that satisfy these optimality conditions. Solutions to the trust-region subproblem are computed to high-accuracy even in the so-called "hard case".

Fulltekst (pdf)
Shape-Changing L-SR1 Trust-Region Methods
• 66.
Parallel Algorithms Team, CERFACS, Toulouse Cedex, France.
A greedy algorithm for the optimal basis problem1997Inngår i: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 37, nr 3, s. 591-599Artikkel i tidsskrift (Fagfellevurdert)

The following problem is considered. Given m+1 points {x i }0 m in R n which generate an m-dimensional linear manifold, construct for this manifold a maximally linearly independent basis that consists of vectors of the form x i x j . This problem is present in, e.g., stable variants of the secant and interpolation methods, where it is required to approximate the Jacobian matrix f′ of a nonlinear mappingf by using values off computed at m+1 points. In this case, it is also desirable to have a combination of finite differences with maximal linear independence. As a natural measure of linear independence, we consider the hadamard condition number which is minimized to find an optimal combination of m pairs {x i ,x j }. We show that the problem is not NP-hard, but can be reduced to the minimum spanning tree problem, which is solved by the greedy algorithm in O(m 2) time. The complexity of this reduction is equivalent to one m×n matrix-matrix multiplication, and according to the Coppersmith-Winograd estimate, is below O(n 2.376) for m=n. Applications of the algorithm to interpolation methods are discussed.

• 67.
Component-wise quasi-Newton methods1991Inngår i: Numerical methods of nonlinear programming and their implementations / [ed] C. Richter, H. Hollatz and D. Pallaschke, Berlin: Akademie Verlag, 1991, s. 17-27Kapittel i bok, del av antologi (Annet vitenskapelig)
• 68.
Computing Center, USSR Academy of Sciences, Moscow.
Conjugate direction methods for solving systems of equations and finding saddle points. Part 11982Inngår i: Engineering Cybernetics, ISSN 0013-788X, Vol. 20, nr 3, s. 13-19Artikkel i tidsskrift (Fagfellevurdert)

This article is devoted to the development of methods of pseudo-orthogonal directions for solving systems of nonlinear equations in which the mapping is uniformly monotonic. Rapidly convergent methods that do not involve evaluation of derivatives are constructed. They constitute a generalization of such methods of unconditional minimization as the method of parallel displacements, Zangwill's method, and Powell's method. The methods developed can be applied, in particular, to finding saddle points of uniformly convex-concave functions.

• 69.
Computing Center, USSR Academy of Sciences, Moscow.
Conjugate direction methods for solving systems of equations and finding saddle points. Part 21982Inngår i: Engineering Cybernetics, ISSN 0013-788X, Vol. 20, nr 4, s. 23-31Artikkel i tidsskrift (Fagfellevurdert)

This article is the second part of a paper devoted to the development of methods of pseudo-orthogonal directions for solving systems of nonlinear equations (for part I see Eng. Cybern. 1982, Vol. 20, No. 3, p. 13-19). An approach is developed for studying the reate of convergence of such methods. Local quadratic convergence of the proposed methods to the solution of the system of equations is proven. This implies the quadratic convergence of some methods of unconstrained minimization: the method of parallel displacements, Zangull's method, and Powell's method.

• 70.
Computing Center, USSR Academy of Sciences, Moscow.
Methods of the secant type for systems of equations with symmetric Jacobian matrix1983Inngår i: Numerical Functional Analysis and Optimization, ISSN 0163-0563, E-ISSN 1532-2467, Vol. 6, nr 2, s. 183-195Artikkel i tidsskrift (Fagfellevurdert)

Symmetric methods (SS methods) of the secant type are proposed for systems of equations with symmetric Jacobian matrix. The SSI and SS2 methods generate sequences of symmetric matrices J and H which approximate the Jacobian matrix and inverse one, respectively. Rank-two quasi-Newton formulas for updating J and H are derived. The structure of the approximations J and H is better than the structure of the corresponding approximations in the traditional secant method because the SS methods take into account symmetry of the Jacobian matrix. Furthermore, the new methods retain the main properties of the traditional secant method, namely, J and H-1are consistent approximations to the Jacobian matrix; the SS methods converge superlinearly; the sequential (n + 1)-point SS methods have the R-order at least equal to the positive root of tn+1-tn-1=0.

• 71.
Parallel Algorithms Group, CERFACS, Toulouse, France.
On properties of Newton's method for smooth and nonsmooth equations1995Inngår i: Recent Trends in Optimization Theory and Applications / [ed] R.P. Agarwal, World Scientific, 1995, s. 17-24Kapittel i bok, del av antologi (Annet vitenskapelig)

Variational inequalities, nonlinear programming, complementarity problems and other problems can be reduced to nonsmooth equations, for which some generalizations of Newton's method are known. The Newton path, as a natural generalization of the Newton direction, was suggested by D.Ralph for enlarging the convergence region (globalization) of Newton-Robinson's method in the nonsmooth case. We investigate some properties of both the Newton direction and the Newton path, which seem to be basic for various globalization strategies. In particular, a simple formula for the derivative of an arbitrary norm of residuals along the Newton direction,derived earlier by the author for the smooth equations, is generalizedhere for the derivative along the Newton path.

• 72.
On solving saddle point problems and monotone equations2018Inngår i: IX Moscow International Conference on Operations Research (ORM2018). Moscow, October 22-27, 2018. Proceedings, Volume 1 / [ed] A.A. Vasin and A.F. Izmailov, Moscow, 2018, Vol. 1, s. 47-50Konferansepaper (Fagfellevurdert)
• 73.
Computing Center of the USSR Academy of Sciences, Moscow.
On Superlinear Convergence of Some Stable Variants of the Secant Method1986Inngår i: Zeitschrift für angewandte Mathematik und Mechanik, ISSN 0044-2267, E-ISSN 1521-4001, Vol. 66, nr 2, s. 615-622Artikkel i tidsskrift (Fagfellevurdert)

In a recent author's paper four classes of methods of the secant type for solving systems of nonlinear equations were proposed. They are stable with respect to linear dependence of the search directions. If the Jacobian matrix is symmetric, then two of them take into account this property. It is proved here that some four special methods from the classes converge superlinearly.

• 74.
CERFACS, Parallel Algorithms Team, Toulouse, France.
On using the minimum spanning tree algorithm for optimal secant approximation of derivatives1996Inngår i: Zeitschrift für angewandte Mathematik und Mechanik, ISSN 0044-2267, E-ISSN 1521-4001, Vol. 76, nr S3, s. 389-390Artikkel i tidsskrift (Fagfellevurdert)

The following problem is considered. Given m + 1 points {xi}0m in Rn which generate an m-dimensional linear manifold, construct for this manifold a maximally linearly independent basis that consists of vectors of the form xi - xj. This problem is present in, e.g., stable variants of the secant method, where it is required to approximate the Jacobian matrix f' of a nonlinear mapping f by using values off computed at m + 1 points. In this case, it is also desirable to have a combination of finite differences with maximal linear independence. As a natural measure of linear independence, we consider a functional which is maximized to find an optimal combination of m pairs {xi, xj}. We show that the problem is not of combinatorial complexity but can be reduced to the minimum spanning tree (MST) problem, which is solved by an MST-type algorithm in O(m2n) time.

• 75.
Computing Center, USSR Academy of Sciences, Moscow.
Some globally convergent modifications of Newton's method for solving systems of nonlinear equations1980Inngår i: Soviet mathematics - Doklady, ISSN 0197-6788, Vol. 22, nr 2, s. 376-378Artikkel i tidsskrift (Fagfellevurdert)
• 76.
Computing Center of the USSR Academy of Sciences, Moscow .
Stable symmetric secant methods with restart1991Inngår i: Cybernetics and Systems Analysis, ISSN 1060-0396, E-ISSN 1573-8337, Vol. 27, nr 3, s. 390-396Artikkel i tidsskrift (Fagfellevurdert)

Two secant type methods are proposed for solving systems of nonlinear equations with a symmetrical Jacobi matrix. Quasi-Newton rank-two updating formulas are used. Stability and superlinear convergence are proved.

• 77.
Computing Center, USSR Academy of Sciences, Moscow.
Stable versions of the secants method for solving systems of equations1983Inngår i: Computational Mathematics and Mathematical Physics, ISSN 0965-5425, E-ISSN 1555-6662, Vol. 23, nr 5, s. 1-10Artikkel i tidsskrift (Fagfellevurdert)

An interpretation of quasi-Newton methods of solving sets of equations is given, and provides the basis of four versions of the secantsmethod, stable with respect to a linear dependence of the directions of motion. The first version involves an approximation of the matrix of first derivatives (the Jacobi matrix), and the second an approximation of the inverse Jacobi matrix. The other two versions are aimed at solving sets of equations with symmetric Jacobi matrix. The stability of the versions is proved.

• 78.
Stabilized Barzilai-Borwein methodManuskript (preprint) (Annet vitenskapelig)

The Barzilai-Borwein (BB) method is a popular and efficient tool for solving large-scale unconstrained optimization problems. Its search direction is the same as for the steepest descent (Cauchy) method, but its stepsize rule is different. Owing to this, it converges much faster than the Cauchy method. A feature of the BB method is that it may generate too long steps, which throw the iterates too far away from the solution. Moreover, it may not converge, even when the objective function is strongly convex. In this paper, a stabilization technique is introduced. It consists in bounding the distance between each pair of successive iterates, which often allows for decreasing the number of BB iterations. When the BB method does not converge, our simple modification of this method makes it convergent. Under suitable assumptions, we prove its global convergence, despite the fact that no line search is involved, and only gradient values are used. Since the number of stabilization steps is proved to be finite, the stabilized version inherits the fast local convergence of the BB method. The presented results of extensive numerical experiments show that our stabilization technique often allows the BB method to solve problems in a fewer iterations, or even to solve problems where the latter fails.

• 79.
Chinese Academy of Sciences, Beijing, China. China Agricultural University, Beijing, China.
Stabilized Barzilai-Borwein method2019Inngår i: Journal of Computational Mathematics, ISSN 0254-9409, E-ISSN 1991-7139, Vol. 37, nr 6, s. 916-936Artikkel i tidsskrift (Fagfellevurdert)

The Barzilai-Borwein (BB) method is a popular and efficient tool for solving large-scale unconstrained optimization problems. Its search direction is the same as for the steepest descent (Cauchy) method, but its stepsize rule is different. Owing to this, it converges much faster than the Cauchy method. A feature of the BB method is that it may generate too long steps, which throw the iterates too far away from the solution. Moreover, it may not converge, even when the objective function is strongly convex. In this paper, a stabilization technique is introduced. It consists in bounding the distance between each pair of successive iterates, which often allows for decreasing the number of BB iterations. When the BB method does not converge, our simple modification of this method makes it convergent. For strongly convex functions with Lipschits gradients, we prove its global convergence, despite the fact that no line search is involved, and only gradient values are used. Since the number of stabilization steps is proved to be finite, the stabilized version inherits the fast local convergence of the BB method. The presented results of extensive numerical experiments show that our stabilization technique often allows the BB method to solve problems in a fewer iterations, or even to solve problems where the latter fails.

• 80.
Linköpings universitet, Institutionen för datavetenskap, KPLAB - Laboratoriet för kunskapsbearbetning. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, KPLAB - Laboratoriet för kunskapsbearbetning. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, KPLAB - Laboratoriet för kunskapsbearbetning. Linköpings universitet, Tekniska högskolan.
Positioning Unmanned Aerial Vehicles As Communication Relays for Surveillance Tasks2010Inngår i: Robotics: Science and Systems V / [ed] Jeff Trinkle, Yoky Matsuoka, Jose Castellanos, MIT Press, 2010, s. 257-264Konferansepaper (Fagfellevurdert)

When unmanned aerial vehicles (UAVs) are used to survey distant targets, it is important to transmit sensor information back to a base station. As this communication often requires high uninterrupted bandwidth, the surveying UAV often needs afree line-of-sight to the base station, which can be problematic in urban or mountainous areas. Communication ranges may also belimited, especially for smaller UAVs. Though both problems can be solved through the use of relay chains consisting of one or more intermediate relay UAVs, this leads to a new problem: Where should relays be placed for optimum performance? We present two new algorithms capable of generating such relay chains, one being a dual ascent algorithm and the other a modification of the Bellman-Ford algorithm. As the priorities between the numberof hops in the relay chain and the cost of the chain may vary, wecalculate chains of different lengths and costs and let the ground operator choose between them. Several different formulations for edge costs are presented. In our test cases, both algorithms are substantially faster than an optimized version of the original Bellman-Ford algorithm, which is used for comparison.

• 81.
Optimal Scheduling for Replacing Perimeter Guarding Unmanned Aerial Vehicles2014Rapport (Annet vitenskapelig)

Guarding the perimeter of an area in order to detect potential intruders is an important task in a variety of security-related applications. This task can in many circumstances be performed by a set of camera-equipped unmanned aerial vehicles (UAVs). Such UAVs will occasionally require refueling or recharging, in which case they must temporarily be replaced by other UAVs in order to maintain complete surveillance of the perimeter. In this paper we consider the problem of scheduling such replacements. We present optimal replacement strategies and justify their optimality.

Fulltekst (pdf)
Optimal Scheduling for Replacing Perimeter Guarding Unmanned Aerial Vehicles
• 82.
Brandenburg University of Technology, Germany.
Stable multi-point secant methods with released requirements to point's position1994Inngår i: System Modelling and Optimization: proceedings of the 16th IFIP-TC7 conference, Compiègne, France-July 5-9, 1993 / [ed] J. Henry and J.-P. Yvon, London/Berlin: Springer, 1994, s. 225-236Kapittel i bok, del av antologi (Annet vitenskapelig)
• 83.
Samsung Advanced Institute of Technology, China Lab, Beijing, China. State Key Laboratory of Scientic and Engineering Computing, Institute of Computational. Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
On Efficiently Combining Limited Memory and Trust-Region Techniques2013Rapport (Annet vitenskapelig)

Limited memory quasi-Newton methods and trust-region methods represent two efficient approaches used for solving unconstrained optimization problems. A straightforward combination of them deteriorates the efficiency of the former approach, especially in the case of large-scale problems. For this reason, the limited memory methods are usually combined with a line search. We show how to efficiently combine limited memory and trust-region techniques. One of our approaches is based on the eigenvalue decomposition of the limited memory quasi-Newton approximation of the Hessian matrix. The decomposition allows for finding a nearly-exact solution to the trust-region subproblem defined by the Euclidean norm with an insignificant computational overhead compared with the cost of computing the quasi-Newton direction in line-search limited memory methods. The other approach is based on two new eigenvalue-based norms. The advantage of the new norms is that the trust-region subproblem is separable and each of the smaller subproblems is easy to solve. We show that our eigenvalue-based limited-memory trust-region methods are globally convergent. Moreover, we propose improved versions of the existing limited-memory trust-region algorithms. The presented results of numerical experiments demonstrate the efficiency of our approach which is competitive with line-search versions of the L-BFGS method.

Fulltekst (pdf)
On Efficiently Combining Limited Memory and Trust-Region Techniques
• 84.
Tencent, Beijing, China. Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska fakulteten. State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing, AMSS, CAS, Beijing, China.
On Efficiently Combining Limited-Memory and Trust-Region Techniques2017Inngår i: Mathematical Programming Computation, ISSN 1867-2949, E-ISSN 1867-2957, Vol. 9, nr 1, s. 101-134Artikkel i tidsskrift (Fagfellevurdert)

Limited-memory quasi-Newton methods and trust-region methods represent two efficient approaches used for solving unconstrained optimization problems. A straightforward combination of them deteriorates the efficiency of the former approach, especially in the case of large-scale problems. For this reason, the limited-memory methods are usually combined with a line search. We show how to efficiently combine limited-memory and trust-region techniques. One of our approaches is based on the eigenvalue decomposition of the limited-memory quasi-Newton approximation of the Hessian matrix. The decomposition allows for finding a nearly-exact solution to the trust-region subproblem defined by the Euclidean norm with an insignificant computational overhead as compared with the cost of computing the quasi-Newton direction in line-search limited-memory methods. The other approach is based on two new eigenvalue-based norms. The advantage of the new norms is that the trust-region subproblem is separable and each of the smaller subproblems is easy to solve. We show that our eigenvalue-based limited-memory trust-region methods are globally convergent. Moreover, we propose improved versions of the existing limited-memory trust-region algorithms. The presented results of numerical experiments demonstrate the efficiency of our approach which is competitive with line-search versions of the L-BFGS method.

Fulltekst (pdf)
fulltext
• 85.
A generalised PAV algorithm for monotonic regression in several variables2004Inngår i: COMPSTAT. Proceedings in Computational Statistics / [ed] J. Antoch, Heidelberg, NY: PhysicaVerlag/Springer , 2004, s. 761-767Konferansepaper (Fagfellevurdert)

We present a new algorithm for monotonic regression in one or more explanatory variables. Formally, our method generalises the well-known PAV (pool-adjacent-violators) algorithm from fully to partially ordered data. The computational complexity of our algorithm is O(n2). The goodness-of-fit to observed data is much closer to optimal than for simple averaging techniques.

• 86.
Generalized PAV algorithm with block refinement for partially ordered monotonic regression2009Inngår i: Proceedings of the Workshop on Learning Monotone Models from Data / [ed] A. Feelders and R. Potharst, 2009, s. 23-37Konferansepaper (Annet vitenskapelig)

In this paper, the monotonic regression problem (MR) is considered. We have recentlygeneralized for MR the well-known Pool-Adjacent-Voilators algorithm(PAV) from the case of completely to partially ordered data sets. Thenew algorithm, called GPAV, combines both high accuracy and lowcomputational complexity which grows quadratically with the problemsize. The actual growth observed in practice is typically far lowerthan quadratic. The fitted values of the exact MR solution composeblocks of equal values. Its GPAV approximation has also a blockstructure. We present here a technique for refining blocks produced bythe GPAV algorithm to make the new blocks more close to those in theexact solution. This substantially improves the accuracy of the GPAVsolution and does not deteriorate its computational complexity. Thecomputational time for the new technique is approximately triple thetime of running the GPAV algorithm. Its efficiency is demonstrated byresults of our numerical experiments.

• 87.
University of Science and Technology of Mazandaran, Behshar, Iran.
Multipoint secant and interpolation methods with nonmonotone line search for solving systems of nonlinear equations2018Inngår i: Applied Mathematics and Computation, ISSN 0096-3003, E-ISSN 1873-5649, Vol. 338, nr 1, s. 421-431Artikkel i tidsskrift (Fagfellevurdert)

Multipoint secant and interpolation methods are effective tools for solving systems of nonlinear equations. They use quasi-Newton updates for approximating the Jacobian matrix. Owing to their ability to more completely utilize the information about the Jacobian matrix gathered at the previous iterations, these methods are especially efficient in the case of expensive functions. They are known to be local and superlinearly convergent. We combine these methods with the nonmonotone line search proposed by Li and Fukushima (2000), and study global and superlinear convergence of this combination. Results of numerical experiments are presented. They indicate that the multipoint secant and interpolation methods tend to be more robust and efficient than Broyden’s method globalized in the same way.

Fulltekst tilgjengelig fra 2020-07-11 00:01
• 88.
University of Würzburg, Germany. Technical University of Darmstadt, Germany.
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method2016Inngår i: SIAM Journal on Optimization, ISSN 1052-6234, E-ISSN 1095-7189, Vol. 26, nr 1, s. 397-425Artikkel i tidsskrift (Fagfellevurdert)

Optimization problems with cardinality constraints are very difficult mathematical programs which are typically solved by global techniques from discrete optimization. Here we introduce a mixed-integer formulation whose standard relaxation still has the same solutions (in the sense of global minima) as the underlying cardinality-constrained problem; the relation between the local minima is also discussed in detail. Since our reformulation is a minimization problem in continuous variables, it allows to apply ideas from that field to cardinality-constrained problems. Here, in particular, we therefore also derive suitable stationarity conditions and suggest an appropriate regularization method for the solution of optimization problems with cardinality constraints. This regularization method is shown to be globally convergent to a Mordukhovich-stationary point. Extensive numerical results are given to illustrate the behavior of this method.

Fulltekst (pdf)
fulltext
• 89.
University of Würzburg. Technical University of Darmstadt.
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-type Constraints and a Regularization Method2014Rapport (Annet vitenskapelig)

Optimization problems with cardinality constraints are very diﬃcult mathematical programs which are typically solved by global techniques from discreteoptimization. Here we introduce a mixed-integer formulation whose standard relaxation still has the same solutions (in the sense of global minima) as the underlying cardinality-constrained problem; the relation between thelocal minima is also discussed in detail. Since our reformulation is a mini-mization problem in continuous variables, it allows to apply ideas from thatﬁeld to cardinality-constrained problems. Here, in particular, we therefore also derive suitable stationarity conditions and suggest an appropriate regularization method for the solution of optimization problems with cardinalityconstraints. This regularization method is shown to be globally convergentto a Mordukhovich-stationary point. Extensive numerical results are given to illustrate the behavior of this method.

Fulltekst (pdf)
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-type Constraints and a Regularization Method
• 90.
University of Würzburg, Germany. Technical University of Darmstadt, Germany.
On a Reformulation of Mathematical Programs with Cardinality Constraints2015Inngår i: Advances in Global Optimization / [ed] David Gao, Ning Ruan and Wenxun Xing, Switzerland: Springer International Publishing , 2015, s. 3-14Kapittel i bok, del av antologi (Fagfellevurdert)

Mathematical programs with cardinality constraints are optimization problems with an additional constraint which requires the solution to be sparse in the sense that the number of nonzero elements, i.e. the cardinality, is bounded by a given constant. Such programs can be reformulated as a mixed-integer ones in which the sparsity is modeled with the use of complementarity-type constraints. It is shown that the standard relaxation of the integrality leads to a nonlinear optimization program of the striking property that its solutions (global minimizers) are the same as the solutions of the original program with cardinality constraints. Since the number of local minimizers of the relaxed program is typically larger than the number of local minimizers of the cardinality-constrained problem, the relationship between the local minimizers is also discussed in detail. Furthermore, we show under which assumptions the standard KKT conditions are necessary optimality conditions for the relaxed program. The main result obtained for such conditions is significantly different from the existing optimality conditions that are known for the somewhat related class of mathematical programs with complementarity constraints.

• 91.
Institute of Numerical Mathematics, Russian Academy of Sciences, Moscow, Russia. Institute of Numerical Mathematics, Russian Academy of Sciences, Moscow, Russia.
Monotonicity recovering and accuracy preserving optimization methods for postprocessing finite element solutions2011Rapport (Annet vitenskapelig)

We suggest here a least-change correction to available finite element (FE) solution.This postprocessing procedure is aimed at recoveringthe monotonicity and some other important properties that may not beexhibited by the FE solution. It is based on solvinga monotonic regression problem with some extra constraints.One of them is a linear equality-type constraint which models the conservativityrequirement. The other ones are box-type constraints, andthey originate from the discrete maximum principle.The resulting postprocessing problem is a large scale quadratic optimization problem. It is proved that the postprocessedFE solution preserves the accuracy of the discrete FE approximation.We introduce an algorithm for solving the postprocessingproblem. It can be viewed as a dual ascent method basedon the Lagrangian relaxation of the equality constraint.We justify theoretically its correctness.Its efficiency is demonstrated by the presented results of numerical experiments.

Fulltekst (pdf)
FULLTEXT01
• 92.
Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles2017Inngår i: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 249, nr 1, s. 163-174Artikkel i tidsskrift (Fagfellevurdert)

Guarding the perimeter of an area in order to detect potential intruders is an important task in a variety of security-related applications. This task can in many circumstances be performed by a set of camera-equipped unmanned aerial vehicles (UAVs). Such UAVs will occasionally require refueling or recharging, in which case they must temporarily be replaced by other UAVs in order to maintain complete surveillance of the perimeter. In this paper we consider the problem of scheduling such replacements. We present optimal replacement strategies and justify their optimality.

Fulltekst (pdf)
fulltext
• 93.
A Dual Active-Set Algorithm for Regularized Monotonic Regression2017Inngår i: Journal of Optimization Theory and Applications, ISSN 0022-3239, E-ISSN 1573-2878, Vol. 172, nr 3, s. 929-949Artikkel i tidsskrift (Fagfellevurdert)

Monotonic (isotonic) regression is a powerful tool used for solving a wide range of important applied problems. One of its features, which poses a limitation on its use in some areas, is that it produces a piecewise constant fitted response. For smoothing the fitted response, we introduce a regularization term in the monotonic regression, formulated as a least distance problem with monotonicity constraints. The resulting smoothed monotonic regression is a convex quadratic optimization problem. We focus on the case, where the set of observations is completely (linearly) ordered. Our smoothed pool-adjacent-violators algorithm is designed for solving the regularized problem. It belongs to the class of dual active-set algorithms. We prove that it converges to the optimal solution in a finite number of iterations that does not exceed the problem size. One of its advantages is that the active set is progressively enlarging by including one or, typically, more constraints per iteration. This resulted in solving large-scale test problems in a few iterations, whereas the size of that problems was prohibitively too large for the conventional quadratic optimization solvers. Although the complexity of our algorithm grows quadratically with the problem size, we found its running time to grow almost linearly in our computational experiments.

Fulltekst (pdf)
fulltext
• 94.
A Dual Active-Set Algorithm for Regularized Slope-Constrained Monotonic Regression2017Inngår i: Iranian Journal of Operations Research, ISSN 2008-1189, Vol. 8, nr 2, s. 40-47Artikkel i tidsskrift (Fagfellevurdert)

In many problems, it is necessary to take into account monotonic relations. Monotonic (isotonic) Regression (MR) is often involved in solving such problems. The MR solutions are of a step-shaped form with a typical sharp change of values between adjacent steps. This, in some applications, is regarded as a disadvantage. We recently introduced a Smoothed MR (SMR) problem which is obtained from the MR by adding a regularization penalty term. The SMR is aimed at smoothing the aforementioned sharp change. Moreover, its solution has a far less pronounced step-structure, if at all available. The purpose of this paper is to further improve the SMR solution by getting rid of such a structure. This is achieved by introducing a lowed bound on the slope in the SMR. We call it Smoothed Slope-Constrained MR (SSCMR) problem. It is shown here how to reduce it to the SMR which is a convex quadratic optimization problem. The Smoothed Pool Adjacent Violators (SPAV) algorithm developed in our recent publications for solving the SMR problem is adapted here to solving the SSCMR problem. This algorithm belongs to the class of dual active-set algorithms. Although the complexity of the SPAV algorithm is o(n2) its running time is growing in our computational experiments almost linearly with n. We present numerical results which illustrate the predictive performance quality of our approach. They also show that the SSCMR solution is free of the undesirable features of the MR and SMR solutions.

• 95.
Regularized monotonic regression2016Rapport (Annet vitenskapelig)

Monotonic (isotonic) Regression (MR) is a powerful tool used for solving a wide range of important applied problems. One of its features, which poses a limitation on its use in some areas, is that it produces a piecewise constant fitted response. For smoothing the fitted response, we introduce a regularization term in the MR formulated as a least distance problem with monotonicity constraints. The resulting Smoothed Monotonic Regrassion (SMR) is a convex quadratic optimization problem. We focus on the SMR, where the set of observations is completely (linearly) ordered. Our Smoothed Pool-Adjacent-Violators (SPAV) algorithm is designed for solving the SMR. It belongs to the class of dual activeset algorithms. We proved its finite convergence to the optimal solution in, at most, n iterations, where n is the problem size. One of its advantages is that the active set is progressively enlarging by including one or, typically, more constraints per iteration. This resulted in solving large-scale SMR test problems in a few iterations, whereas the size of that problems was prohibitively too large for the conventional quadratic optimization solvers. Although the complexity of the SPAV algorithm is O(n2), its running time was growing in our computational experiments in proportion to n1:16.

Fulltekst (pdf)
Regularized Monotonic Regression
• 96.
An algorithm for isotonic regression problems2004Inngår i: European Congress on Computational Methods in Applied Sciences and Engineering ECCOMAS / [ed] P. Neittaanmäki, T. Rossi, K. Majava and O. Pironneau, Jyväskylä: University of Jyväskylä , 2004, s. 1-9Konferansepaper (Fagfellevurdert)

We consider the problem of minimizing the distance from a given n-dimensional vector to a set defined by constraintsof the form   xi $\leq$ xj Such constraints induce a partial order of the components xi, which can be illustrated by an acyclic directed graph.This problem is known as the isotonic regression (IR) problem. It has important applications in statistics, operations research and signal processing. The most of the applied IR problems are characterized by a very large value of n. For such large-scale problems, it is of great practical importance to develop algorithms whose complexity does not rise with n too rapidly.The existing optimization-based algorithms and statistical IR algorithms have either too high computational complexity or too low accuracy of the approximation to the optimal solution they generate. We introduce a new IR algorithm, which can be viewed as a generalization of the Pool-Adjacent-Violator (PAV) algorithm from completely to partially ordered data. Our algorithm combines both low computational complexity O(n2) and high accuracy. This allows us to obtain sufficiently accurate solutions to the IR problems with thousands of observations.

• 97.
An O(n2) algorithm for isotonic regression problems2006Inngår i: Large-Scale Nonlinear Optimization / [ed] G. Di Pillo and M. Roma, Springer-Verlag , 2006, s. 25-33Kapittel i bok, del av antologi (Fagfellevurdert)

Large-Scale Nonlinear Optimization reviews and discusses recent advances in the development of methods and algorithms for nonlinear optimization and its applications, focusing on the large-dimensional case, the current forefront of much research.

The chapters of the book, authored by some of the most active and well-known researchers in nonlinear optimization, give an updated overview of the field from different and complementary standpoints, including theoretical analysis, algorithmic development, implementation issues and applications

• 98.
Asymptotiska egenskaper för Lanczosspinoren2003Independent thesis Basic level (professional degree)Oppgave

Asymptotically flat spaces are widely studied because it is one natural way of describing an isolated system in general relativity. In this thesis we study what happens to the Lanczos potential at spacelike infinity in such spacetimes. By transformations of the Weyl-Lanczos equation, we derive expressions for the limiting equations on both the timelike unit hyperboloid, and the timelike unit cylinder. Finally the Newman-Penrose formalism is used to get a component version of the equations.

Fulltekst (pdf)
FULLTEXT01
• 99. Kjøp publikasjonen >>
Inverse Shortest Path Routing Problems in the Design of IP Networks2010Licentiatavhandling, monografi (Annet vitenskapelig)

This thesis is concerned with problems related to shortest pathrouting (SPR) in Internet protocol (IP) networks. In IP routing, alldata traffic is routed in accordance with an SPR protocol, e.g. OSPF.That is, the routing paths are shortest paths w.r.t. some artificialmetric. This implies that the majority of the Internet traffic isdirected by SPR. Since the Internet is steadily growing, efficientutilization of its resources is of major importance. In theoperational planning phase the objective is to utilize the availableresources as efficiently as possible without changing the actualdesign. That is, only by re-configuration of the routing. This isreferred to as traffic engineering (TE). In this thesis, TE in IPnetworks and related problems are approached by integer linearprogramming.

Most TE problems are closely related to multicommodity routingproblems and they are regularly solved by integer programmingtechniques. However, TE in IP networks has not been studied as much,and is in fact a lot harder than ordinary TE problems without IProuting since the complicating shortest path aspect has to be takeninto account. In a TE problem in an IP network the routing isperformed in accordance with an SPR protocol that depends on a metric,the so called set of administrative weights. The major differencebetween ordinary TE problems and TE in IP networks is that all routingpaths must be simultaneously realizable as shortest paths w.r.t. thismetric. This restriction implies that the set of feasible routingpatterns is significantly reduced and that the only means available toadjust and control the routing is indirectly, via the administrativeweights.

A constraint generation method for solving TE problems in IP networksis outlined in this thesis. Given an "original" TE problem, the ideais to iteratively generate and augment valid inequalities that handlethe SPR aspect of IP networks. These valid inequalities are derived byanalyzing the inverse SPR problem. The inverse SPR problem is todecide if a set of tentative routing patterns is simultaneouslyrealizable as shortest paths w.r.t. some metric. When this is not thecase, an SPR conflict exists which must be prohibited by a validinequality that is then augmented to the original TE problem. Toderive strong valid inequalities that prohibit SPR conflicts, athorough analysis of the inverse SPR problem is first performed. Inthe end, this allows us to draw conclusions for the design problem,which was the initial primary concern.

Fulltekst (pdf)
Inverse Shortest Path Routing Problems in the Design of IP Networks
• 100.
Stable Coexistence of Three Species in Competition2009Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave

This report consider a system describing three competing species with populations x, y and z. Sufficient conditions for every positive equilibrium to be asymptotically stable have been found. First it is shown that conditions on the pairwise competitive interaction between the populations are needed. Actually, these conditions are equivalent to asymptotic stability for any two-dimensional competing system of the three species. It is also shown that these alone are not enough, and that a condition on the competitive interaction between all three populations is also needed. If all conditions are fulfilled, each population will survive on a long-term basis and there will be a stable coexistence.

Fulltekst (pdf)
FULLTEXT01
1234567 51 - 100 of 572
Referera
Referensformat
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• oxford
• Annet format
Fler format
Språk
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Annet språk
Fler språk
Utmatningsformat
• html
• text
• asciidoc
• rtf