Skip to main content
Top

2015 | OriginalPaper | Chapter

51. An Algorithm for Construction of Constrained D-Optimum Designs

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A computational algorithm is proposed for determinant maximization over the set of all convex combinations of a finite number of nonnegative definite matrices subject to additional box constraints on the weights of those combinations. The underlying idea is to apply a simplicial decomposition algorithm in which the restricted master problem reduces to an uncomplicated multiplicative weight optimization algorithm.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Atkinson AC, Donev AN, Tobias RD (2007) Optimum experimental designs, with SAS. Oxford University Press, New York Atkinson AC, Donev AN, Tobias RD (2007) Optimum experimental designs, with SAS. Oxford University Press, New York
3.
go back to reference Fellman J (1974) On the allocation of linear observations (Thesis). Comment Phys Math 44(2):27–78 MathSciNet Fellman J (1974) On the allocation of linear observations (Thesis). Comment Phys Math 44(2):27–78 MathSciNet
4.
go back to reference Harman R, Trnovská M (2009) Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices. Math Slovaca 59:693–704 MathSciNetCrossRef Harman R, Trnovská M (2009) Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices. Math Slovaca 59:693–704 MathSciNetCrossRef
5.
go back to reference Patan M (2012) Distributed scheduling of sensor networks for identification of spatio-temporal processes. Int J Appl Math Comput Sci 22(2):299–311 MathSciNetCrossRef Patan M (2012) Distributed scheduling of sensor networks for identification of spatio-temporal processes. Int J Appl Math Comput Sci 22(2):299–311 MathSciNetCrossRef
6.
go back to reference Patriksson M (2001) Simplicial decomposition algorithms. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization, vol 5. Kluwer, Dordrecht, pp 205–212 Patriksson M (2001) Simplicial decomposition algorithms. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization, vol 5. Kluwer, Dordrecht, pp 205–212
7.
go back to reference Pázman A (1986) Foundations of optimum experimental design. Reidel, Dordrecht Pázman A (1986) Foundations of optimum experimental design. Reidel, Dordrecht
8.
go back to reference Sahm M, Schwabe R (2001) A note on optimal bounded designs. In: Atkinson A, Bogacka B, Zhigljavsky A (eds) Optimum design 2000. Kluwer, Dordrecht, pp 131–140 CrossRef Sahm M, Schwabe R (2001) A note on optimal bounded designs. In: Atkinson A, Bogacka B, Zhigljavsky A (eds) Optimum design 2000. Kluwer, Dordrecht, pp 131–140 CrossRef
10.
go back to reference Torsney B, Mandal S (2004) Multiplicative algorithms for constructing optimizing distributions: further developments. In: Di Bucchianico A, Läuter H, Wynn HP (eds) mODa 7. Proc 7th int workshop on model-oriented data analysis. Physica-Verlag, Heidelberg, pp 163–171 Torsney B, Mandal S (2004) Multiplicative algorithms for constructing optimizing distributions: further developments. In: Di Bucchianico A, Läuter H, Wynn HP (eds) mODa 7. Proc 7th int workshop on model-oriented data analysis. Physica-Verlag, Heidelberg, pp 163–171
11.
go back to reference Uciński D (2005) Optimal measurement methods for distributed-parameter system identification. CRC Press, Boca Raton Uciński D (2005) Optimal measurement methods for distributed-parameter system identification. CRC Press, Boca Raton
12.
go back to reference Uciński D (2012) Sensor network scheduling for identification of spatially distributed processes. Int J Appl Math Comput Sci 22(1):25–40 MathSciNet Uciński D (2012) Sensor network scheduling for identification of spatially distributed processes. Int J Appl Math Comput Sci 22(1):25–40 MathSciNet
13.
go back to reference Uciński D, Patan M (2007) D-optimal design of a monitoring network for parameter estimation of distributed systems. J Glob Optim 39(2):291–322 CrossRef Uciński D, Patan M (2007) D-optimal design of a monitoring network for parameter estimation of distributed systems. J Glob Optim 39(2):291–322 CrossRef
Metadata
Title
An Algorithm for Construction of Constrained D-Optimum Designs
Author
Dariusz Uciński
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-13881-7_51

Premium Partner