Atjaunināt sīkdatņu piekrišanu

Optimization in Function Spaces: With Stability Considerations in Orlicz Spaces [Hardback]

Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 244,20 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Bibliotēkām
    • De Gruyter E-books
Citas grāmatas par šo tēmu:
This is an essentially self-contained book on the theory of convex functions and convex optimization in Banach spaces, with a special interest in Orlicz spaces.

Approximate algorithms based on the stability principles and the solution of the corresponding nonlinear equations are developed in this text. A synopsis of the geometry of Banach spaces, aspects of stability and the duality of different levels of differentiability and convexity is developed. A particular emphasis is placed on the geometrical aspects of strong solvability of a convex optimization problem: it turns out that this property is equivalent to local uniform convexity of the corresponding convex function. This treatise also provides a novel approach to the fundamental theorems of Variational Calculus based on the principle of pointwise minimization of the Lagrangian on the one hand and convexification by quadratic supplements using the classical Legendre-Ricatti equation on the other.

The reader should be familiar with the concepts of mathematical analysis and linear algebra. Some awareness of the principles of measure theory will turn out to be helpful. The book is suitable for students of the second half of undergraduate studies, and it provides a rich set of material for a master course on linear and nonlinear functional analysis. Additionally it offers novel aspects at the advanced level.

From the contents:





Approximation and Polya Algorithms in Orlicz Spaces Convex Sets and Convex Functions Numerical Treatment of Non-linear Equations and Optimization Problems Stability and Two-stage Optimization Problems Orlicz Spaces, Orlicz Norm and Duality Differentiability and Convexity in Orlicz Spaces Variational Calculus

Recenzijas

"[ ...] this is essentially a self-contained, interesting and well-written book, parts of it being suitable for undergraduate students with a good background in mathematical analysis, linear algebra and measure theory. The book also provides material for master's-level courses and for advanced research in nonlinear and functional analysis."Constantin Z?linescu in: University of Michigan Mathematical Reviews 2012c

Preface v
1 Approximation in Orlicz Spaces
1(33)
1.1 Introduction
1(6)
1.2 A Brief Framework for Approximation in Orlicz Spaces
7(2)
1.3 Approximation in C(T)
9(11)
1.3.1 Chebyshev Approximations in C(T)
10(2)
1.3.2 Approximation in Haar Subspaces
12(8)
1.4 Discrete LΦ-approximations
20(8)
1.4.1 Discrete Chebyshev Approximation
20(4)
1.4.2 Linear LΦ-approximation for Finite Young Functions
24(4)
1.5 Determination of the Linear LΦ-approximation
28(6)
1.5.1 System of Equations for the Coefficients
28(1)
1.5.2 The Method of Karlovitz
29(5)
2 Polya Algorithms in Orlicz Spaces
34(38)
2.1 The Classical Polya Algorithm
34(1)
2.2 Generalized Polya Algorithm
34(1)
2.3 Polya Algorithm for the Discrete Chebyshev Approximation
35(6)
2.3.1 The Strict Approximation as the Limit of Polya Algorithms
37(2)
2.3.2 About the Choice of the Young Functions
39(1)
2.3.3 Numerical Execution of the Polya Algorithm
40(1)
2.4 Stability of Polya Algorithms in Orlicz Spaces
41(4)
2.5 Convergence Estimates and Robustness
45(13)
2.5.1 Two-Stage Optimization
47(2)
2.5.2 Convergence Estimates
49(9)
2.6 A Polya-Remez Algorithm in C(T)
58(6)
2.7 Semi-infinite Optimization Problems
64(8)
2.7.1 Successive Approximation of the Restriction Set
64(8)
3 Convex Sets and Convex Functions
72(43)
3.1 Geometry of Convex Sets
72(4)
3.2 Convex Functions
76(4)
3.3 Difference Quotient and Directional Derivative
80(5)
3.3.1 Geometry of the Right-sided Directional Derivative
81(4)
3.4 Necessary and Sufficient Optimality Conditions
85(1)
3.4.1 Necessary Optimality Conditions
85(1)
3.4.2 Sufficient Condition: Characterization Theorem of Convex Optimization
85(1)
3.5 Continuity of Convex Functions
86(1)
3.6 Frechet Differentiability
87(1)
3.7 Convex Functions in Rn
88(3)
3.8 Continuity of the Derivative
91(4)
3.9 Separation Theorems
95(4)
3.10 Subgradients
99(3)
3.11 Conjugate Functions
102(3)
3.12 Theorem of Fenchel
105(4)
3.13 Existence of Minimal Solutions for Convex Optimization
109(2)
3.14 Lagrange Multipliers
111(4)
4 Numerical Treatment of Non-linear Equations and Optimization Problems
115(14)
4.1 Newton Method
116(2)
4.2 Secant Methods
118(2)
4.3 Global Convergence
120(8)
4.3.1 Damped Newton Method
122(2)
4.3.2 Globalization of Secant Methods for Equations
124(2)
4.3.3 Secant Method for Minimization
126(2)
4.4 A Matrix-free Newton Method
128(1)
5 Stability and Two-stage Optimization Problems
129(46)
5.1 Lower Semi-continuous Convergence and Stability
129(3)
5.1.1 Lower Semi-equicontinuity and Lower Semi-continuous Convergence
130(1)
5.1.2 Lower Semi-continuous Convergence and Convergence of Epigraphs
131(1)
5.2 Stability for Monotone Convergence
132(2)
5.3 Continuous Convergence and Stability for Convex Functions
134(13)
5.3.1 Stability Theorems
141(6)
5.4 Convex Operators
147(6)
5.5 Quantitative Stability Considerations in Rn
153(3)
5.6 Two-stage Optimization
156(10)
5.6.1 Second Stages and Stability for Epsilon-solutions
164(2)
5.7 Stability for Families of Non-linear Equations
166(9)
5.7.1 Stability for Monotone Operators
167(4)
5.7.2 Stability for Wider Classes of Operators
171(1)
5.7.3 Two-stage Solutions
172(3)
6 Orlicz Spaces
175(39)
6.1 Young Functions
175(10)
6.2 Modular and Luxemburg Norm
185(23)
6.2.1 Examples of Orlicz Spaces
188(5)
6.2.2 Structure of Orlicz Spaces
193(4)
6.2.3 The Δ2-condition
197(11)
6.3 Properties of the Modular
208(6)
6.3.1 Convergence in Modular
208(3)
6.3.2 Level Sets and Balls
211(1)
6.3.3 Boundedness of the Modular
212(2)
7 Orlicz Norm and Duality
214(27)
7.1 The Orlicz Norm
214(1)
7.2 Holder's Inequality
215(1)
7.3 Lower Semi-continuity and Duality of the Modular
216(4)
7.4 Jensen's Integral Inequality and the Convergence in Measure
220(4)
7.5 Equivalence of the Norms
224(3)
7.6 Duality Theorems
227(6)
7.7 Reflexivity
233(1)
7.8 Separability and Bases of Orlicz Spaces
234(2)
7.8.1 Separability
234(2)
7.8.2 Bases
236(1)
7.9 Amemiya formula and Orlicz Norm
236(5)
8 Differentiability and Convexity in Orlicz Spaces
241(68)
8.1 Flat Convexity and Weak Differentiability
241(3)
8.2 Flat Convexity and Gateaux Differentiability of Orlicz Spaces
244(3)
8.3 A-differentiability and B-convexity
247(6)
8.4 Local Uniform Convexity, Strong Solvability and Frechet Differentiability of the Conjugate
253(14)
8.4.1 E-spaces
262(5)
8.5 Frechet differentiability and Local Uniform Convexity in Orlicz Spaces
267(14)
8.5.1 Frechet Differentiability of Modular and Luxemburg Norm
267(9)
8.5.2 Frechet Differentiability and Local Uniform Convexity
276(2)
8.5.3 Frechet Differentiability of the Orlicz Norm and Local Uniform Convexity of the Luxemburg Norm
278(2)
8.5.4 Summary
280(1)
8.6 Uniform Convexity and Uniform Differentiability
281(12)
8.6.1 Uniform Convexity of the Orlicz Norm
283(5)
8.6.2 Uniform Convexity of the Luxemburg Norm
288(5)
8.7 Applications
293(16)
8.7.1 Regularization of Tikhonov Type
294(4)
8.7.2 Ritz's Method
298(1)
8.7.3 A Greedy Algorithm in Orlicz Space
299(10)
9 Variational Calculus
309(62)
9.1 Introduction
309(7)
9.1.1 Equivalent Variational Problems
311(1)
9.1.2 Principle of Pointwise Minimization
312(1)
9.1.3 Linear Supplement
313(3)
9.2 Smoothness of Solutions
316(4)
9.3 Weak Local Minima
320(5)
9.3.1 Caratheodory Minimale
325(1)
9.4 Strong Convexity and Strong Local Minima
325(8)
9.4.1 Strong Local Minima
330(3)
9.5 Necessary Conditions
333(2)
9.5.1 The Jacobi Equation as a Necessary Condition
333(2)
9.6 C1-variational Problems
335(1)
9.7 Optimal Paths
336(1)
9.8 Stability Considerations for Variational Problems
337(17)
9.8.1 Parametric Treatment of the Dido problem
339(2)
9.8.2 Dido problem
341(4)
9.8.3 Global Optimal Paths
345(1)
9.8.4 General Stability Theorems
346(3)
9.8.5 Dido problem with Two-dimensional Quadratic Supplement
349(3)
9.8.6 Stability in Orlicz-Sobolev Spaces
352(2)
9.9 Parameter-free Approximation of Time Series Data by Monotone Functions
354(9)
9.9.1 Projection onto the Positive Cone in Sobolev Space
354(3)
9.9.2 Regularization of Tikhonov-type
357(5)
9.9.3 A Robust Variant
362(1)
9.10 Optimal Control Problems
363(8)
9.10.1 Minimal Time Problem as a Linear L1-approximation Problem
365(6)
Bibliography 371(8)
List of Symbols 379(2)
Index 381
Peter Kosmol, Christian Albrechts University, Kiel, Germany; Dieter Müller-Wichards, Hamburg University of Applied Sciences, Germany.