|Title:||Optimality conditions of semi-infinite programming and generalized semi-infinite programming|
Hong Kong Polytechnic University -- Dissertations
|Department:||Department of Applied Mathematics|
|Pages:||vi, 111 p. ; 30 cm.|
|Abstract:||Semi-infinite programming has been long an important model of optimization problems, arising from areas such as approximation, control, probability. Generalized semi-infinite programming has also been an active research area with relatively short history. Nonetheless it has been known that the study of a generalized semi-infinite programming problem is much more difficult than a semi-infinite programming problem. The purpose of this thesis is to develop necessary optimality conditions for semi-infinite and generalized semi-infinite programming problems with penalty functions techniques as well as other approaches. We introduce two types of p-th order penalty functions (0 < p ≤ 1), for semi-infinite programming problems, and explore various relations between them and their relations with corresponding calmness conditions. Under the exactness of certain type penalty functions and some other appropriate conditions especially second order conditions of the constraint functions, we develop optimality conditions for semi-infinite programming problems. This process is also applied to generalized semi-infinite programming problems after being equivalently transformed into standard semi-infinite programming problems. Via the transformation of penalty functions of the lower level problems, we study some properties of the feasible set of the generalized semi-infinite programming problem which is known to possess unusual properties such as non-closedness, re-entrant corners, disjunctive structures, and further establish a sequence of approximate optimization problems and approximate properties for generalized semi-infinite programming problems. We also investigate nonsmooth generalized semi-infinite programming problems via generalization differentiation and derive corresponding optimality conditions via variational analysis tools. Finally, we characterize the strong duality theory of generalized semi-infinite programming problems with convex lower level problems via generalized augmented Lagrangians.|
|Rights:||All rights reserved|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: