No label defined (Q4679593)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2177227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2177227 |
Statements
20 June 2005
0 references
convex sets
0 references
convex functions
0 references
approximations
0 references
unconstrained optimisation
0 references
constrained optimisation
0 references
linear programming
0 references
nonlinear programming
0 references
convex optimization
0 references
0.8641133904457092
0 references
0.8626831769943237
0 references
0.8621476292610168
0 references
0.8609703183174133
0 references
The book serves as undergraduate text for students who study fundamentals of convex analysis. The book consists of 5 chapters, references, an index and numerous figures. Each chapter is finished by numerous exercises for solving. We give a presentation of the contents of each chapter. Chapter 1 is introductory. It deals with basic notions and results related to the extremum problems for functions of one and many variables. The main attention is paid to the necessary conditions of an extremum for differentiable functions. The sufficient conditions are examined too. The Lagrange multipliers method is considered as the basic one to find solutions to the conditional extremum problems. Chapter 2. Convex sets. This chapter presents basic properties of convex sets, convex cones, affine sets. Separation theorems and their applications are examined in details. Chapter 3. Convex functions. Definitions and properties of convex, strictly convex, and strong convex functions are presented. Convex optimisation problem is analysed. Examples and properties of quasi-convex (pseudo-convex, etc) functions are described. Chapter 4. Subgradient and subdifferential of convex function. This chapter deals with elements of subdifferential calculus for convex functions. Subdifferential mapping is considered as the main tool of proving basic properties of subdifferentials. Systems of convex and linear inequalities are examined in details. Chapter 5. Mathematical programming problems. First, the mathematical programming problem is formulated. The subdifferential conditions of optimality are described. The Lagrange multipliers and the Kuhn-Tucker conditions are given for differentiable functions. The Kuhn-Tucker theorem is proved for non-differentiable functions. Economical interpretations of the Kuhn-Tucker vector are described. The book will benefit both teacher and student.
0 references