Optimization by Vector Space MethodsEngineers must make decisions regarding the distribution of expensive resources in a manner that will be economically beneficial. This problem can be realistically formulated and logically analyzed with optimization theory. This book shows engineers how to use optimization theory to solve complex problems. Unifies the large field of optimization with a few geometric principles. Covers functional analysis with a minimum of mathematics. Contains problems that relate to the applications in the book. |
From inside the book
Results 1-5 of 74
Page x
... DUAL SPACES 103 5.1 Introduction 103 LINEAR FUNCTIONALS 104 5.2 Basic Concepts 104 533 5.3 Duals of Some Common Banach Spaces 106 EXTENSION FORM OF THE HAHN - BANACH THEOREM 110 Extension of Linear Functionals 110 The Dual of C [ a , b ] ...
... DUAL SPACES 103 5.1 Introduction 103 LINEAR FUNCTIONALS 104 5.2 Basic Concepts 104 533 5.3 Duals of Some Common Banach Spaces 106 EXTENSION FORM OF THE HAHN - BANACH THEOREM 110 Extension of Linear Functionals 110 The Dual of C [ a , b ] ...
Page xi
... Dual Problem 161 6.11 Pseudoinverse Operators 163 6.12 Problems 165 References 168 7 OPTIMIZATION OF FUNCTIONALS 169 7.1 Introduction 169 LOCAL THEORY 171 7.2 Gateaux and Fréchet Differentials 171 7.3 Fréchet Derivatives 175 177 * 7.5 ...
... Dual Problem 161 6.11 Pseudoinverse Operators 163 6.12 Problems 165 References 168 7 OPTIMIZATION OF FUNCTIONALS 169 7.1 Introduction 169 LOCAL THEORY 171 7.2 Gateaux and Fréchet Differentials 171 7.3 Fréchet Derivatives 175 177 * 7.5 ...
Page xii
... Dual Optimization Problems 200 * 7.13 Min - Max Theorem of Game Theory 206 7.14 Problems 209 References 212 8 GLOBAL THEORY OF CONSTRAINED OPTIMIZATION 213 8.1 Introduction 213 8.2 Positive Cones and Convex Mappings 214 8.3 Lagrange ...
... Dual Optimization Problems 200 * 7.13 Min - Max Theorem of Game Theory 206 7.14 Problems 209 References 212 8 GLOBAL THEORY OF CONSTRAINED OPTIMIZATION 213 8.1 Introduction 213 8.2 Positive Cones and Convex Mappings 214 8.3 Lagrange ...
Page xiii
... PROBLEMS 297 10.9 Projection Methods 297 10.10 The Primal - Dual Method 299 10.11 Penalty Functions 302 10.12 Problems 308 References 311 SYMBOL INDEX 321 SUBJECT INDEX 323 NOTATION Sets If x is a member of the set CONTENTS.
... PROBLEMS 297 10.9 Projection Methods 297 10.10 The Primal - Dual Method 299 10.11 Penalty Functions 302 10.12 Problems 308 References 311 SYMBOL INDEX 321 SUBJECT INDEX 323 NOTATION Sets If x is a member of the set CONTENTS.
Page 10
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Contents
INTRODUCTION | 1 |
The Main Principles | 8 |
2 | 14 |
NORMED LINEAR SPACES | 22 |
HILBERT SPACE | 46 |
APPROXIMATION | 55 |
Approximation and Fourier Series | 62 |
LEASTSQUARES ESTIMATION | 78 |
GEOMETRIC FORM OF THE HAHNBANACH | 129 |
LINEAR OPERATORS AND ADJOINTS | 143 |
ADJOINTS | 150 |
Duality Relations for Convex Cones | 157 |
OPTIMIZATION OF FUNCTIONALS | 169 |
GLOBAL THEORY OF CONSTRAINED OPTIMIZATION | 213 |
LOCAL THEORY OF CONSTRAINED OPTIMIZATION | 239 |
5 | 253 |
8 | 97 |
DUAL SPACES | 103 |
EXTENSION FORM OF THE HAHNBANACH | 110 |
7 | 116 |
ITERATIVE METHODS OF OPTIMIZATION | 271 |
METHODS FOR SOLVING CONSTRAINED | 297 |
321 | |
Other editions - View all
Common terms and phrases
adjoint applied arbitrary assume Banach space bounded linear functional Cauchy sequence chapter closed subspace components conjugate functional consider constraints contains continuous functions control problem convergence convex functional convex set definition denoted derivatives dimensional dual space element equivalent Example exists finite finite-dimensional follows Fréchet differentiable functional ƒ G(xo Gateaux differential geometric given gradient Hahn-Banach theorem hence Hilbert space hyperplane inequality inner product interior point inverse Lagrange multiplier Lemma linear combination linear operator linear variety linear vector space linearly independent mapping matrix minimum norm problems n-dimensional Newton's method nonzero normed linear space normed space optimal control optimization problems orthogonal orthonormal polynomial positive cone pre-Hilbert space projection theorem Proof Proposition random variables real numbers result satisfying scalar Section Show solution solved space H sphere subset subspace Suppose t₁ t₂ theory unique vector space x₁ y₁ zero