語系:
繁體中文
English
說明(常見問題)
登入
回首頁
(回前一個查詢頁籤)
[ subject:"519.6" ]
切換:
標籤
|
MARC模式
|
ISBD
Mathematics of optimization : smooth...
~
Giorgi, G.
Mathematics of optimization : smooth and nonsmooth case
紀錄類型:
書目-語言資料,印刷品 : 單行本
副題名:
smooth and nonsmooth case
作者:
GiorgiG.,
合作者:
GuerraggioAngelo, 1948-
合作者:
ThierfelderJ.,
其他團體作者:
ScienceDirect (Online service)
出版地:
Amsterdam
出版者:
Elsevier;
出版年:
2004.
版本:
1st ed.
面頁冊數:
xv, 598 p.24 cm.;
標題:
Mathematical optimization. -
標題:
Nonlinear programming. -
標題:
Electronic books. -
標題:
Otimiza簙跾o matem榥tica. -
標題:
Programa簙跾o matem榥tica. -
電子資源:
http://www.loc.gov/catdir/description/els051/2004040362.html
電子資源:
http://www.loc.gov/catdir/description/els051/2004040362.html
電子資源:
http://www.loc.gov/catdir/description/els051/2004040362.html
附註:
Electronic reproduction. Amsterdam : Elsevier Science & Technology, 2007.
摘要註:
The book is intended for people (graduates, researchers, but also undergraduates with a good mathematical background) involved in the study of (static) optimization problems (in finite-dimensional spaces). It contains a lot of material, from basic tools of convex analysis to optimality conditions for smooth optimization problems, for non smooth optimization problems and for vector optimization problems. The development of the subjects are self-contained and the bibliographical references are usually treated in different books (only a few books on optimization theory deal also with vector problems), so the book can be a starting point for further readings in a more specialized literature. Assuming only a good (even if not advanced) knowledge of mathematical analysis and linear algebra, this book presents various aspects of the mathematical theory in optimization problems. The treatment is performed in finite-dimensional spaces and with no regard to algorithmic questions. After two chapters concerning, respectively, introductory subjects and basic tools and concepts of convex analysis, the book treats extensively mathematical programming problems in the smmoth case, in the nonsmooth case and finally vector optimization problems. Self-contained Clear style and results are either proved or stated precisely with adequate references The authors have several years experience in this field Several subjects (some of them non usual in books of this kind) in one single book, including nonsmooth optimization and vector optimization problems Useful long references list at the end of each chapter.
ISBN:
0444505504
內容註:
Contents Preface. CHAPTER I.INTRODUCTION. 1.1 Optimization Problems. 1.2 Basic Mathematical Preliminaries and Notations. References to Chapter I. CHAPTER II.CONVEX SETS, CONVEX AND GENERALIZED CONVEX FUNCTIONS. 2.1 Convex Sets and Their Main Properties. 2.2 Separation Theorems. 2.3 Some Particular Convex Sets. Convex Cone. 2.4 Theorems of the Alternative for Linear Systems. 2.5 Convex Functions. 2.6 Directional Derivatives and Subgradients of Convex Functions. 2.7 Conjugate Functions. 2.8 Extrema of Convex Functions. 2.9 Systems of Convex Functions and Nonlinear Theorems of the Alternative. 2.10 Generalized Convex Functions. 2.11 Relationships Between the Various Classes of Generalized Convex Functions. Properties in Optimization Problems. 2.12 Generalized Monotonicity and Generalized Convexity. 2.13 Comparison Between Convex and Generalized Convex Functions. 2.14 Generalized Convexity at a Point. 2.15 Convexity, Pseudoconvexity and Quasiconvexity of Composite Functions. 2.16 Convexity, Pseudoconvexity and Quasiconvexity of Quadratic Functions. 2.17 Other Types of Generalized Convex Functions References to Chapter II. CHAPTER III.SMOOTH OPTIMIZATION PROBLEMS SADDLE POINT CONDITIONS. 3.1 Introduction. 3.2 Unconstrained Extremum Problems and Extremum Problems with a Set Constraint. 3.3 Equality Constrained Extremum Problems. 3.4 Local Cone Approximations of Sets. 3.5 Necessary Optimality Conditions for Problem (P) where the Optimal Point is Interior to X. 3.6 Necessary Optimality Conditions for Problems (P e); and The Case of a Set Constraint. 3.7 Again on Constraint Qualifications. 3.8 Necessary Optimality Conditions for (P 1). 3.9 Sufficient First-Order Optimality Conditions for (P) and (P 1). 3.10 Second-Order Optimality Conditions. 3.11 Linearization Properties of a Nonlinear Programming Problem. 3.12 Some Specific Cases. 3.13 Extensions to Topological Spaces. 3.14 Optimality Criteria of the Saddle Point Type References to Chapter III CHAPTER IV. NONSMOOTH OPTIMIZATION PROBLEMS. 4.1 Preliminary Remarks. 4.2 Differentiability. 4.3 Directional Derivatives and Subdifferentials for Convex Functions. 4.4 Generalized Directional Derivatives. 4.5 Generalized Gradient Mappings. 4.6 Abstract Cone Approximations of Sets and Relating Differentiability Notions. 4.7 Special K-Directional Derivative. 4.8 Generalized Optimality Conditions. References to Chapter IV CHAPTER V. DUALITY. 5.1 Preliminary Remarks. 5.2 Duality in Linear Optimization. 5.3 Duality in Convex Optimization (Wolfe Duality). 5.4 Lagrange Duality. 5.5 Perturbed Optimization Problems. References to Chapter V CHAPTER VI. VECTOR OPTIMIZATION. 6.1 Vector Optimization Problems. 6.2 Conical Preference Orders. 6.3 Optimality (or Efficiency) Notions. 6.4 Proper Efficiency. 6.5 Theorems of Existence. 6.6 Optimality Conditions. 6.7 Scalarization. 6.8 The Nondifferentiable Case. References to Chapter VI. SUBJECT INDEX.
Mathematics of optimization : smooth and nonsmooth case
Giorgi, G.
Mathematics of optimization
: smooth and nonsmooth case / G. Giorgi, A. Guerraggio, J. Thierfelder. - 1st ed.. - Amsterdam : Elsevier, 2004.. - xv, 598 p. ; 24 cm..
Contents.
Electronic reproduction. Amsterdam : Elsevier Science & Technology, 2007..
Includes bibliographical references and index..
ISBN 0444505504ISBN 9780444505507
Mathematical optimization.Nonlinear programming.Electronic books.Otimiza簙跾o matem榥tica.Programa簙跾o matem榥tica.
Guerraggio, Angelo
Mathematics of optimization : smooth and nonsmooth case
LDR
:05735cam 2200325Ii 4500
001
363445
005
20130114165315
009
157981
010
1
$a
0444505504
010
1
$a
9780444505507
100
$a
20070802d2004 u0engy0103 b
101
0
$a
eng
102
$a
ne
135
$a
v
200
1
$a
Mathematics of optimization
$e
smooth and nonsmooth case
$f
G. Giorgi, A. Guerraggio, J. Thierfelder.
204
1
$a
[electronic resource]
205
$a
1st ed.
210
$a
Amsterdam
$a
Boston
$c
Elsevier
$d
2004.
215
1
$a
xv, 598 p.
$d
24 cm.
300
$a
Electronic reproduction. Amsterdam : Elsevier Science & Technology, 2007.
320
$a
Includes bibliographical references and index.
327
0
$a
Contents
$a
Preface.
$a
CHAPTER I.INTRODUCTION.
$a
1.1 Optimization Problems.
$a
1.2 Basic Mathematical Preliminaries and Notations.
$a
References to Chapter I.
$a
CHAPTER II.CONVEX SETS, CONVEX AND GENERALIZED CONVEX FUNCTIONS.
$a
2.1 Convex Sets and Their Main Properties.
$a
2.2 Separation Theorems.
$a
2.3 Some Particular Convex Sets. Convex Cone.
$a
2.4 Theorems of the Alternative for Linear Systems.
$a
2.5 Convex Functions.
$a
2.6 Directional Derivatives and Subgradients of Convex Functions.
$a
2.7 Conjugate Functions.
$a
2.8 Extrema of Convex Functions.
$a
2.9 Systems of Convex Functions and Nonlinear Theorems of the Alternative.
$a
2.10 Generalized Convex Functions.
$a
2.11 Relationships Between the Various Classes of Generalized Convex Functions. Properties in Optimization Problems.
$a
2.12 Generalized Monotonicity and Generalized Convexity.
$a
2.13 Comparison Between Convex and Generalized Convex Functions.
$a
2.14 Generalized Convexity at a Point.
$a
2.15 Convexity, Pseudoconvexity and Quasiconvexity of Composite Functions.
$a
2.16 Convexity, Pseudoconvexity and Quasiconvexity of Quadratic Functions.
$a
2.17 Other Types of Generalized Convex Functions References to Chapter II.
$a
CHAPTER III.SMOOTH OPTIMIZATION PROBLEMS
$a
SADDLE POINT CONDITIONS.
$a
3.1 Introduction.
$a
3.2 Unconstrained Extremum Problems and Extremum
$a
Problems with a Set Constraint.
$a
3.3 Equality Constrained Extremum Problems.
$a
3.4 Local Cone Approximations of Sets.
$a
3.5 Necessary Optimality Conditions for Problem (P) where the Optimal Point is Interior to X.
$a
3.6 Necessary Optimality Conditions for Problems (P e); and The Case of a Set Constraint.
$a
3.7 Again on Constraint Qualifications.
$a
3.8 Necessary Optimality Conditions for (P 1).
$a
3.9 Sufficient First-Order Optimality Conditions for (P) and (P 1).
$a
3.10 Second-Order Optimality Conditions.
$a
3.11 Linearization Properties of a Nonlinear Programming Problem.
$a
3.12 Some Specific Cases.
$a
3.13 Extensions to Topological Spaces.
$a
3.14 Optimality Criteria of the Saddle Point Type References to Chapter III
$a
CHAPTER IV. NONSMOOTH OPTIMIZATION PROBLEMS.
$a
4.1 Preliminary Remarks.
$a
4.2 Differentiability.
$a
4.3 Directional Derivatives and Subdifferentials for Convex Functions.
$a
4.4 Generalized Directional Derivatives.
$a
4.5 Generalized Gradient Mappings.
$a
4.6 Abstract Cone Approximations of Sets and Relating Differentiability Notions.
$a
4.7 Special K-Directional Derivative.
$a
4.8 Generalized Optimality Conditions.
$a
References to Chapter IV
$a
CHAPTER V. DUALITY.
$a
5.1 Preliminary Remarks.
$a
5.2 Duality in Linear Optimization.
$a
5.3 Duality in Convex Optimization (Wolfe Duality).
$a
5.4 Lagrange Duality.
$a
5.5 Perturbed Optimization Problems.
$a
References to Chapter V
$a
CHAPTER VI. VECTOR OPTIMIZATION.
$a
6.1 Vector Optimization Problems.
$a
6.2 Conical Preference Orders.
$a
6.3 Optimality (or Efficiency) Notions.
$a
6.4 Proper Efficiency.
$a
6.5 Theorems of Existence.
$a
6.6 Optimality Conditions.
$a
6.7 Scalarization.
$a
6.8 The Nondifferentiable Case.
$a
References to Chapter VI.
$a
SUBJECT INDEX.
330
0
$a
The book is intended for people (graduates, researchers, but also undergraduates with a good mathematical background) involved in the study of (static) optimization problems (in finite-dimensional spaces). It contains a lot of material, from basic tools of convex analysis to optimality conditions for smooth optimization problems, for non smooth optimization problems and for vector optimization problems. The development of the subjects are self-contained and the bibliographical references are usually treated in different books (only a few books on optimization theory deal also with vector problems), so the book can be a starting point for further readings in a more specialized literature. Assuming only a good (even if not advanced) knowledge of mathematical analysis and linear algebra, this book presents various aspects of the mathematical theory in optimization problems. The treatment is performed in finite-dimensional spaces and with no regard to algorithmic questions. After two chapters concerning, respectively, introductory subjects and basic tools and concepts of convex analysis, the book treats extensively mathematical programming problems in the smmoth case, in the nonsmooth case and finally vector optimization problems. Self-contained Clear style and results are either proved or stated precisely with adequate references The authors have several years experience in this field Several subjects (some of them non usual in books of this kind) in one single book, including nonsmooth optimization and vector optimization problems Useful long references list at the end of each chapter.
452
1
$1
0101
$a
0444505504
606
$a
Mathematical optimization.
$3
455335
606
$a
Nonlinear programming.
$3
455336
606
$a
Electronic books.
$3
452603
606
$a
Otimiza簙跾o matem榥tica.
$3
455337
606
$a
Programa簙跾o matem榥tica.
$3
455338
676
$a
519.6
$v
22
680
$a
QA402.5
$b
.G55 2004eb
700
1
$a
Giorgi
$b
G.
$g
(Giorgio)
$3
455332
701
1
$a
Guerraggio
$b
Angelo
$f
1948-
$3
455333
701
1
$a
Thierfelder
$b
J.
$g
(J鋌rg)
$3
455334
712
0 2
$a
ScienceDirect (Online service)
$3
454379
801
0
$a
tw
$b
TUL
$c
20090617
801
1
$a
tw
$b
TUL
$c
20090617
856
7
$u
http://www.loc.gov/catdir/description/els051/2004040362.html
856
7
$u
http://www.sciencedirect.com/science/book/9780444505507
$z
An electronic book accessible through the World Wide Web; click for information
856
7
$u
http://www.loc.gov/catdir/toc/els051/2004040362.html
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
修改密碼
登入