- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Approximate subdifferential of piecewise linear-quadratic...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Approximate subdifferential of piecewise linear-quadratic functions Bajaj, Anuj
Abstract
Optimization is a branch of mathematics dealing with the selection of the best element(s) (based on some criteria) from a set of available options. In the study of optimization, we often come across problems involving functions that are not differentiable, thus, one cannot employ the tool of differentiation to solve or analyze such functions. Such an issue can be resolved with the help of subdifferentials. Subgradients generalize derivatives to nondifferentiable functions, which makes them one of the most useful and powerful instruments in nonsmooth optimization. However, they may come with a few limitations. Some limitations may be overcome by using approximate subdifferentials, which are a certain relaxation of true subdifferentials. In this thesis, we present a general algorithm to compute approximate subdifferential of any proper convex function. We then implement the algorithm for the family of convex univariate piecewise linear-quadratic functions - an important model class of functions for nonlinear systems. We provide many numerical examples. Finally, some directions and insights for future work are detailed.
Item Metadata
Title |
Approximate subdifferential of piecewise linear-quadratic functions
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2016
|
Description |
Optimization is a branch of mathematics dealing with the selection of the best element(s) (based on some criteria) from a set of available options. In the study of optimization, we often come across problems involving functions that are not differentiable, thus, one cannot employ the tool of differentiation to solve or analyze such functions. Such an issue can be resolved with the help of subdifferentials.
Subgradients generalize derivatives to nondifferentiable functions, which makes them one of the most useful and powerful instruments in nonsmooth optimization. However, they may come with a few limitations. Some limitations may be overcome by using approximate subdifferentials, which are a certain relaxation of true subdifferentials. In this thesis, we present a general algorithm to compute approximate subdifferential of any proper convex function. We then implement the algorithm for the family of convex univariate piecewise linear-quadratic functions - an important model class of functions for nonlinear systems. We provide many numerical examples. Finally, some directions and insights for future work are detailed.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2016-06-23
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0305102
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2016-09
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International