Anders Hansson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Anders Hansson has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Rikard Falkeborn
Linköping University
4 shared publications - Ragnar Wallin
Linköping University
3 shared publications - Andrea Garulli
Università di Siena
2 shared publications - Christos Papageorgiou
Linköping University
2 shared publications - Daniel Axehill
Division of Automatic Control Linköping University Sweden
2 shared publications - Janne Harju Johansson
Department of Electrical Engineering, Linköping University, 581 83 Linköping, Sweden
2 shared publications
Latest Publications
- Open Access
A distributed primal-dual interior-point method for loosely coupled problems using ADMM
In this paper we propose an efficient distributed algorithm for solving loosely coupled convex optimization problems. The algorithm is based on a primal-dual interior-point method in which we use the alternating direction method of multipliers (ADMM) to compute the primal-dual directions at each iteration of the method. This enables us to join the exceptional convergence properties of primal-dual interior-point methods with the remarkable parallelizability of ADMM. The resulting algorithm has superior computational properties with respect to ADMM directly applied to our problem. The amount of computations that needs to be conducted by each computing agent is far less. In particular, the updates for all variables can be expressed in closed form, irrespective of the type of optimization problem. The most expensive computational burden of the algorithm occur in the updates of the primal variables and can be precomputed in each iteration of the interior-point method. We verify and compare our method to ADMM in numerical experiments.
Open AccessA distributed primal-dual interior-point method for loosely coupled problems using ADMM
In this paper we propose an efficient distributed algorithm for solving loosely coupled convex optimization problems. The algorithm is based on a primal-dual interior-point method in which we use the alternating direction method of multipliers (ADMM) to compute the primal-dual directions at each iteration of the method. This enables us to join the exceptional convergence properties of primal-dual interior-point methods with the remarkable parallelizability of ADMM. The resulting algorithm has superior computational properties with respect to ADMM directly applied to our problem. The amount of computations that needs to be conducted by each computing agent is far less. In particular, the updates for all variables can be expressed in closed form, irrespective of the type of optimization problem. The most expensive computational burden of the algorithm occur in the updates of the primal variables and can be precomputed in each iteration of the interior-point method. We verify and compare our method to ADMM in numerical experiments.
- 2 May 2014
- Published by Taylor & Francis in International Journal of Control
- p. 1-11
Maximum likelihood estimation of linear SISO models subject to missing output data and missing input data
In this paper we describe an approach to maximum likelihood estimation of linear single input single output (SISO) models when both input and output data are missing. The criterion minimised in the algorithms is the Euclidean norm of the prediction error vector scaled by a particular function of the covariance matrix of the observed output data. We also provide insight into when simpler and in general sub-optimal schemes are indeed optimal. The algorithm has been prototyped in MATLAB, and we report numerical results that support the theory.
- 2 May 2014
- Published by Taylor & Francis in International Journal of Control
- p. 1-11
Maximum likelihood estimation of linear SISO models subject to missing output data and missing input data
In this paper we describe an approach to maximum likelihood estimation of linear single input single output (SISO) models when both input and output data are missing. The criterion minimised in the algorithms is the Euclidean norm of the prediction error vector scaled by a particular function of the covariance matrix of the observed output data. We also provide insight into when simpler and in general sub-optimal schemes are indeed optimal. The algorithm has been prototyped in MATLAB, and we report numerical results that support the theory.
- 1 January 2014
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 47 (3) , 9587-9592
Distributed Interior-point Method for Loosely Coupled Problems
- 1 January 2014
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 47 (3) , 9587-9592
Distributed Interior-point Method for Loosely Coupled Problems
- 13 September 2013
- Published by Taylor & Francis in International Journal of Control
- Vol. 87 (2) , 330-345
Sampling method for semidefinite programmes with non-negative Popov function constraints
An important class of optimisation problems in control and signal processing involves the constraint that a Popov function is non-negative on the unit circle or the imaginary axis. Such a constraint is convex in the coefficients of the Popov function. It can be converted to a finite-dimensional linear matrix inequality via the Kalman–Yakubovich–Popov lemma. However, the linear matrix inequality reformulation requires an auxiliary matrix variable and often results in a very large semidefinite programming problem. Several recently published methods exploit problem structure in these semidefinite programmes to alleviate the computational cost associated with the large matrix variable. These algorithms are capable of solving much larger problems than general-purpose semidefinite programming packages. In this paper, we address the same problem by presenting an alternative to the linear matrix inequality formulation of the non-negative Popov function constraint. We sample the constraint to obtain an equivalent set of inequalities of low dimension, thus avoiding the large matrix variable in the linear matrix inequality formulation. Moreover, the resulting semidefinite programme has constraints with low-rank structure, which allows the problems to be solved efficiently by existing semidefinite programming packages. The sampling formulation is obtained by first expressing the Popov function inequality as a sum-of-squares condition imposed on a polynomial matrix and then converting the constraint into an equivalent finite set of interpolation constraints. A complexity analysis and numerical examples are provided to demonstrate the performance improvement over existing techniques.
- 13 September 2013
- Published by Taylor & Francis in International Journal of Control
- Vol. 87 (2) , 330-345
Sampling method for semidefinite programmes with non-negative Popov function constraints
An important class of optimisation problems in control and signal processing involves the constraint that a Popov function is non-negative on the unit circle or the imaginary axis. Such a constraint is convex in the coefficients of the Popov function. It can be converted to a finite-dimensional linear matrix inequality via the Kalman–Yakubovich–Popov lemma. However, the linear matrix inequality reformulation requires an auxiliary matrix variable and often results in a very large semidefinite programming problem. Several recently published methods exploit problem structure in these semidefinite programmes to alleviate the computational cost associated with the large matrix variable. These algorithms are capable of solving much larger problems than general-purpose semidefinite programming packages. In this paper, we address the same problem by presenting an alternative to the linear matrix inequality formulation of the non-negative Popov function constraint. We sample the constraint to obtain an equivalent set of inequalities of low dimension, thus avoiding the large matrix variable in the linear matrix inequality formulation. Moreover, the resulting semidefinite programme has constraints with low-rank structure, which allows the problems to be solved efficiently by existing semidefinite programming packages. The sampling formulation is obtained by first expressing the Popov function inequality as a sum-of-squares condition imposed on a polynomial matrix and then converting the constraint into an equivalent finite set of interpolation constraints. A complexity analysis and numerical examples are provided to demonstrate the performance improvement over existing techniques.
- 1 January 2013
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 46 (13) , 194-199
Decomposition and Projection Methods for Distributed Robustness Analysis of Interconnected Uncertain Systems
- 1 January 2013
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 46 (13) , 194-199
Decomposition and Projection Methods for Distributed Robustness Analysis of Interconnected Uncertain Systems
- 1 January 2012
- Published by Elsevier in European Journal of Control
- Vol. 18 (3) , 249-256
A Decomposition Algorithm for KYP-SDPs
- 1 January 2012
- Published by Elsevier in European Journal of Control
- Vol. 18 (3) , 249-256
A Decomposition Algorithm for KYP-SDPs
- 1 January 2012
- Published by Springer Nature
- p. 313-338
Towards Parallel Implementation of Hybrid MPC—A Survey and Directions for Future Research
- 1 January 2012
- Published by Springer Nature
- p. 313-338
Towards Parallel Implementation of Hybrid MPC—A Survey and Directions for Future Research
- 1 January 2012
- Published by Springer Nature
- p. 359-365
Concluding Remarks and Industrial Perspective
- 1 January 2012
- Published by Springer Nature
- p. 277-297
Applications of IQC-Based Analysis Techniques for Clearance
- 1 January 2012
- Published by Springer Nature
- p. 277-297
Applications of IQC-Based Analysis Techniques for Clearance