Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11889/5609
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Aloqeili, Marwan | |
dc.contributor.author | Masarwah, Noha | |
dc.date.accessioned | 2018-07-28T08:34:21Z | |
dc.date.available | 2018-07-28T08:34:21Z | |
dc.date.issued | 2016 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11889/5609 | |
dc.description.abstract | This research aims mainly to solve an inverse problem arising in convex optimization. (P) n max x f(x) ; Ax = C(A), where f is a strictly increasing funnction with respect to each coordinate of the vector x, the Hessian matrix D2 x f is negative definite on the subspace {Dxf} ⊥, f is of class C 2 , A is an m × n matrix of rank m, C : R m×n ++ → R m ++ is homogeneous of degree one and x ∈ R n . We consider a maximization problem under m linear constraints, we characterize the solutions of this kind of problems and give necessary and sufficient conditions for a given function in R n to be the solution of a multi-constraints maximization problem.oblem. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Mathematical optimization - Problems, exercises, etc. | en_US |
dc.subject | Inverse problems (Differential equations) - Numerical solutions | en_US |
dc.subject | Convex functions | en_US |
dc.title | An inverse problem In convex optimization | en_US |
dc.type | Thesis | en_US |
newfileds.department | Graduate Studies | en_US |
newfileds.item-access-type | open_access | en_US |
newfileds.thesis-prog | Mathematics | en_US |
newfileds.general-subject | none | en_US |
item.languageiso639-1 | other | - |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
Appears in Collections: | Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
thesis.pdf | 501.36 kB | Adobe PDF | View/Open |
Page view(s)
72
Last Week
0
0
Last month
1
1
checked on Apr 14, 2024
Download(s)
77
checked on Apr 14, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.