國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Foundations of average-cost nonhomog...

Cao, Xi-Ren.

Foundations of average-cost nonhomogeneous controlled Markov chains

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Foundations of average-cost nonhomogeneous controlled Markov chainsby Xi-Ren Cao.
作者:	Cao, Xi-Ren.
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	viii, 120 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Markov processes.
電子資源:	https://doi.org/10.1007/978-3-030-56678-4
ISBN:	9783030566784$q(electronic bk.)

Foundations of average-cost nonhomogeneous controlled Markov chains
Cao, Xi-Ren.

Foundations of average-cost nonhomogeneous controlled Markov chains[electronic resource] /by Xi-Ren Cao. - Cham :Springer International Publishing :2021. - viii, 120 p. :ill., digital ;24 cm. - SpringerBriefs in electrical and computer engineering, Control, automation and robotics,2192-6786. - SpringerBriefs in electrical and computer engineering.Control, automation and robotics..

Chapter 1. Introduction -- Chapter 2. Confluencity and State Classification -- Chapter 3. Optimization of Average Rewards and Bias: Single Class -- Chapter 4. Optimization of Average Rewards: Multi-Chains -- Chapter 5. The Nth-Bias and Blackwell Optimality.

This Springer brief addresses the challenges encountered in the study of the optimization of time-nonhomogeneous Markov chains. It develops new insights and new methodologies for systems in which concepts such as stationarity, ergodicity, periodicity and connectivity do not apply. This brief introduces the novel concept of confluencity and applies a relative optimization approach. It develops a comprehensive theory for optimization of the long-run average of time-nonhomogeneous Markov chains. The book shows that confluencity is the most fundamental concept in optimization, and that relative optimization is more suitable for treating the systems under consideration than standard ideas of dynamic programming. Using confluencity and relative optimization, the author classifies states as confluent or branching and shows how the under-selectivity issue of the long-run average can be easily addressed, multi-class optimization implemented, and Nth biases and Blackwell optimality conditions derived. These results are presented in a book for the first time and so may enhance the understanding of optimization and motivate new research ideas in the area.

ISBN: 9783030566784$q(electronic bk.)

Standard No.: 10.1007/978-3-030-56678-4doiSubjects--Topical Terms:

181910
Markov processes.

LC Class. No.: QA274.7 / .C36 2021

Dewey Class. No.: 519.233

Foundations of average-cost nonhomogeneous controlled Markov chains
LDR:02541nmm a2200337 a 4500 001 595161
003 DE-He213
005 20200909165946.0
006 m d
007 cr nn 008maaau
008 211005s2021 sz s 0 eng d
020 $a 9783030566784$q(electronic bk.)
020 $a 9783030566777$q(paper)
024 7 $a 10.1007/978-3-030-56678-4 $2 doi
035 $a 978-3-030-56678-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA274.7 $b .C36 2021
072 7 $a TJFM $2 bicssc
072 7 $a TEC004000 $2 bisacsh
072 7 $a TJFM $2 thema
082 0 4 $a 519.233 $2 23
090 $a QA274.7 $b .C235 2021
100 1 $a Cao, Xi-Ren. $3 869206
245 1 0 $a Foundations of average-cost nonhomogeneous controlled Markov chains $h [electronic resource] / $c by Xi-Ren Cao.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a viii, 120 p. : $b ill., digital ; $c 24 cm.
490 1 $a SpringerBriefs in electrical and computer engineering, Control, automation and robotics, $x 2192-6786
505 0 $a Chapter 1. Introduction -- Chapter 2. Confluencity and State Classification -- Chapter 3. Optimization of Average Rewards and Bias: Single Class -- Chapter 4. Optimization of Average Rewards: Multi-Chains -- Chapter 5. The Nth-Bias and Blackwell Optimality.
520 $a This Springer brief addresses the challenges encountered in the study of the optimization of time-nonhomogeneous Markov chains. It develops new insights and new methodologies for systems in which concepts such as stationarity, ergodicity, periodicity and connectivity do not apply. This brief introduces the novel concept of confluencity and applies a relative optimization approach. It develops a comprehensive theory for optimization of the long-run average of time-nonhomogeneous Markov chains. The book shows that confluencity is the most fundamental concept in optimization, and that relative optimization is more suitable for treating the systems under consideration than standard ideas of dynamic programming. Using confluencity and relative optimization, the author classifies states as confluent or branching and shows how the under-selectivity issue of the long-run average can be easily addressed, multi-class optimization implemented, and Nth biases and Blackwell optimality conditions derived. These results are presented in a book for the first time and so may enhance the understanding of optimization and motivate new research ideas in the area.
650 0 $a Markov processes. $3 181910
650 1 4 $a Control and Systems Theory. $3 825946
650 2 4 $a Statistics and Computing/Statistics Programs. $3 275710
650 2 4 $a Probability Theory and Stochastic Processes. $3 274061
650 2 4 $a Optimization. $3 274084
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in electrical and computer engineering. $p Control, automation and robotics. $3 592008
856 4 0 $u https://doi.org/10.1007/978-3-030-56678-4
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)