語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Separable optimization = theory and ...
~
Stefanov, Stefan M.
FindBook
Google Book
Amazon
博客來
Separable optimization = theory and methods /
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Separable optimization/ by Stefan M. Stefanov.
其他題名:
theory and methods /
作者:
Stefanov, Stefan M.
出版者:
Cham :Springer International Publishing : : 2021.,
面頁冊數:
xvii, 356 p. :ill., digital ;24 cm.
內容註:
Preface to the New Edition -- Preface -- 1 Preliminaries: Convex Analysis and Convex Programming -- Part I. Separable Programming -- 2 Introduction: Approximating the Separable Problem -- 3. Convex Separable Programming -- 4. Separable Programming: A Dynamic Programming Approach -- Part II. Convex Separable Programming With Bounds on the Variables -- 5. Statement of the Main Problem. Basic Result -- 6. Version One: Linear Equality Constraints -- 7. The Algorithms -- 8. Version Two: Linear Constraint of the Form \geq -- 9. Well-Posedness of Optimization Problems. On the Stability of the Set of Saddle Points of the Lagrangian -- 10. Extensions -- 11. Applications and Computational Experiments -- Part III. Selected Supplementary Topics and Applications -- 12. Applications of Convex Separable Unconstrained Nondifferentiable Optimization to Approximation Theory -- 13. About Projections in the Implementation of Stochastic Quasigradient Methods to Some Probabilistic Inventory Control Problems -- 14. Valid Inequalities, Cutting Planes and Integrality ofthe Knapsack Polytope -- 15. Relaxation of the Equality Constrained Convex Continuous Knapsack Problem -- 16. On the Solution of Multidimensional Convex Separable Continuous Knapsack Problem with Bounded Variables -- 17. Characterization of the Optimal Solution of the Convex Generalized Nonlinear Transportation Problem -- Appendices -- A. Some Definitions and Theorems from Calculus -- B. Metric, Banach and Hilbert Spaces -- C. Existence of Solutions to Optimization Problems - A General Approach -- D. Best Approximation: Existence and Uniqueness -- E. On the Solvability of a Quadratic Optimization Problem with a Feasible Region Defined as a Minkowski Sum of a Compact Set and Finitely Generated Convex Closed Cone- F. On the Cauchy-Schwarz Inequality Approach for Solving a Quadratic Optimization Problem -- G. Theorems of the Alternative -- Bibliography -- List of Notation -- List of Statements -- Index.
Contained By:
Springer Nature eBook
標題:
Mathematical optimization. -
電子資源:
https://doi.org/10.1007/978-3-030-78401-0
ISBN:
9783030784010
Separable optimization = theory and methods /
Stefanov, Stefan M.
Separable optimization
theory and methods /[electronic resource] :by Stefan M. Stefanov. - Second edition. - Cham :Springer International Publishing :2021. - xvii, 356 p. :ill., digital ;24 cm. - Springer optimization and its applications,v. 1771931-6836 ;. - Springer optimization and its applications ;v. 177..
Preface to the New Edition -- Preface -- 1 Preliminaries: Convex Analysis and Convex Programming -- Part I. Separable Programming -- 2 Introduction: Approximating the Separable Problem -- 3. Convex Separable Programming -- 4. Separable Programming: A Dynamic Programming Approach -- Part II. Convex Separable Programming With Bounds on the Variables -- 5. Statement of the Main Problem. Basic Result -- 6. Version One: Linear Equality Constraints -- 7. The Algorithms -- 8. Version Two: Linear Constraint of the Form \geq -- 9. Well-Posedness of Optimization Problems. On the Stability of the Set of Saddle Points of the Lagrangian -- 10. Extensions -- 11. Applications and Computational Experiments -- Part III. Selected Supplementary Topics and Applications -- 12. Applications of Convex Separable Unconstrained Nondifferentiable Optimization to Approximation Theory -- 13. About Projections in the Implementation of Stochastic Quasigradient Methods to Some Probabilistic Inventory Control Problems -- 14. Valid Inequalities, Cutting Planes and Integrality ofthe Knapsack Polytope -- 15. Relaxation of the Equality Constrained Convex Continuous Knapsack Problem -- 16. On the Solution of Multidimensional Convex Separable Continuous Knapsack Problem with Bounded Variables -- 17. Characterization of the Optimal Solution of the Convex Generalized Nonlinear Transportation Problem -- Appendices -- A. Some Definitions and Theorems from Calculus -- B. Metric, Banach and Hilbert Spaces -- C. Existence of Solutions to Optimization Problems - A General Approach -- D. Best Approximation: Existence and Uniqueness -- E. On the Solvability of a Quadratic Optimization Problem with a Feasible Region Defined as a Minkowski Sum of a Compact Set and Finitely Generated Convex Closed Cone- F. On the Cauchy-Schwarz Inequality Approach for Solving a Quadratic Optimization Problem -- G. Theorems of the Alternative -- Bibliography -- List of Notation -- List of Statements -- Index.
In this book, the theory, methods and applications of separable optimization are considered. Some general results are presented, techniques of approximating the separable problem by linear programming problem, and dynamic programming are also studied. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and convergent iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. The problems of numerical approximation of tabulated functions and numerical solution of overdetermined systems of linear algebraic equations and some systems of nonlinear equations are solved by separable convex unconstrained minimization problems. Some properties of the Knapsack polytope are also studied. This second edition includes a substantial amount of new and revised content. Three new chapters, 15-17, are included. Chapters 15-16 are devoted to the further analysis of the Knapsack problem. Chapter 17 is focused on the analysis of a nonlinear transportation problem. Three new Appendices (E-G) are also added to this edition and present technical details that help round out the coverage. Optimization problems and methods for solving the problems considered are interesting not only from the viewpoint of optimization theory, optimization methods and their applications, but also from the viewpoint of other fields of science, especially the artificial intelligence and machine learning fields within computer science. This book is intended for the researcher, practitioner, or engineer who is interested in the detailed treatment of separable programming and wants to take advantage of the latest theoretical and algorithmic results. It may also be used as a textbook for a special topics course or as a supplementary textbook for graduate courses on nonlinear and convex optimization.
ISBN: 9783030784010
Standard No.: 10.1007/978-3-030-78401-0doiSubjects--Topical Terms:
517763
Mathematical optimization.
LC Class. No.: QA402.5 / .S74 2021
Dewey Class. No.: 519.6
Separable optimization = theory and methods /
LDR
:05071nmm a2200361 a 4500
001
2301624
003
DE-He213
005
20220115061438.0
006
m d
007
cr nn 008maaau
008
230409s2021 sz s 0 eng d
020
$a
9783030784010
$q
(electronic bk.)
020
$a
9783030784003
$q
(paper)
024
7
$a
10.1007/978-3-030-78401-0
$2
doi
035
$a
978-3-030-78401-0
035
$a
2301624
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA402.5
$b
.S74 2021
072
7
$a
PBU
$2
bicssc
072
7
$a
MAT003000
$2
bisacsh
072
7
$a
PBU
$2
thema
082
0 4
$a
519.6
$2
23
090
$a
QA402.5
$b
.S816 2021
100
1
$a
Stefanov, Stefan M.
$3
3601210
245
1 0
$a
Separable optimization
$h
[electronic resource] :
$b
theory and methods /
$c
by Stefan M. Stefanov.
250
$a
Second edition.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2021.
300
$a
xvii, 356 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Springer optimization and its applications,
$x
1931-6836 ;
$v
v. 177
505
0
$a
Preface to the New Edition -- Preface -- 1 Preliminaries: Convex Analysis and Convex Programming -- Part I. Separable Programming -- 2 Introduction: Approximating the Separable Problem -- 3. Convex Separable Programming -- 4. Separable Programming: A Dynamic Programming Approach -- Part II. Convex Separable Programming With Bounds on the Variables -- 5. Statement of the Main Problem. Basic Result -- 6. Version One: Linear Equality Constraints -- 7. The Algorithms -- 8. Version Two: Linear Constraint of the Form \geq -- 9. Well-Posedness of Optimization Problems. On the Stability of the Set of Saddle Points of the Lagrangian -- 10. Extensions -- 11. Applications and Computational Experiments -- Part III. Selected Supplementary Topics and Applications -- 12. Applications of Convex Separable Unconstrained Nondifferentiable Optimization to Approximation Theory -- 13. About Projections in the Implementation of Stochastic Quasigradient Methods to Some Probabilistic Inventory Control Problems -- 14. Valid Inequalities, Cutting Planes and Integrality ofthe Knapsack Polytope -- 15. Relaxation of the Equality Constrained Convex Continuous Knapsack Problem -- 16. On the Solution of Multidimensional Convex Separable Continuous Knapsack Problem with Bounded Variables -- 17. Characterization of the Optimal Solution of the Convex Generalized Nonlinear Transportation Problem -- Appendices -- A. Some Definitions and Theorems from Calculus -- B. Metric, Banach and Hilbert Spaces -- C. Existence of Solutions to Optimization Problems - A General Approach -- D. Best Approximation: Existence and Uniqueness -- E. On the Solvability of a Quadratic Optimization Problem with a Feasible Region Defined as a Minkowski Sum of a Compact Set and Finitely Generated Convex Closed Cone- F. On the Cauchy-Schwarz Inequality Approach for Solving a Quadratic Optimization Problem -- G. Theorems of the Alternative -- Bibliography -- List of Notation -- List of Statements -- Index.
520
$a
In this book, the theory, methods and applications of separable optimization are considered. Some general results are presented, techniques of approximating the separable problem by linear programming problem, and dynamic programming are also studied. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and convergent iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. The problems of numerical approximation of tabulated functions and numerical solution of overdetermined systems of linear algebraic equations and some systems of nonlinear equations are solved by separable convex unconstrained minimization problems. Some properties of the Knapsack polytope are also studied. This second edition includes a substantial amount of new and revised content. Three new chapters, 15-17, are included. Chapters 15-16 are devoted to the further analysis of the Knapsack problem. Chapter 17 is focused on the analysis of a nonlinear transportation problem. Three new Appendices (E-G) are also added to this edition and present technical details that help round out the coverage. Optimization problems and methods for solving the problems considered are interesting not only from the viewpoint of optimization theory, optimization methods and their applications, but also from the viewpoint of other fields of science, especially the artificial intelligence and machine learning fields within computer science. This book is intended for the researcher, practitioner, or engineer who is interested in the detailed treatment of separable programming and wants to take advantage of the latest theoretical and algorithmic results. It may also be used as a textbook for a special topics course or as a supplementary textbook for graduate courses on nonlinear and convex optimization.
650
0
$a
Mathematical optimization.
$3
517763
650
1 4
$a
Optimization.
$3
891104
650
2 4
$a
Operations Research, Management Science.
$3
1532996
710
2
$a
SpringerLink (Online service)
$3
836513
773
0
$t
Springer Nature eBook
830
0
$a
Springer optimization and its applications ;
$v
v. 177.
$3
3601211
856
4 0
$u
https://doi.org/10.1007/978-3-030-78401-0
950
$a
Mathematics and Statistics (SpringerNature-11649)
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9443173
電子資源
11.線上閱覽_V
電子書
EB QA402.5 .S74 2021
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入