Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/93312
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Applied Mathematics | en_US |
dc.creator | Hu, Y | en_US |
dc.creator | Yu, CKW | en_US |
dc.creator | Yang, X | en_US |
dc.date.accessioned | 2022-06-15T03:42:42Z | - |
dc.date.available | 2022-06-15T03:42:42Z | - |
dc.identifier.issn | 0925-5001 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/93312 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.rights | © Springer Science+Business Media, LLC, part of Springer Nature 2019 | en_US |
dc.rights | This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use(https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s10898-019-00818-6 | en_US |
dc.subject | Incremental approach | en_US |
dc.subject | Quasi-convex programming | en_US |
dc.subject | Subgradient method | en_US |
dc.subject | Sum of ratios problem | en_US |
dc.subject | Sum-minimization problem | en_US |
dc.title | Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Title on author’s file: Incremental Subgradient Methods for Minimizing The Sum of Quasi-convex Functions | en_US |
dc.identifier.spage | 1003 | en_US |
dc.identifier.epage | 1028 | en_US |
dc.identifier.volume | 75 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.doi | 10.1007/s10898-019-00818-6 | en_US |
dcterms.abstract | The sum of ratios problem has a variety of important applications in economics and management science, but it is difficult to globally solve this problem. In this paper, we consider the minimization problem of the sum of a number of nondifferentiable quasi-convex component functions over a closed and convex set. The sum of quasi-convex component functions is not necessarily to be quasi-convex, and so, this study goes beyond quasi-convex optimization. Exploiting the structure of the sum-minimization problem, we propose a new incremental quasi-subgradient method for this problem and investigate its convergence properties to a global optimal value/solution when using the constant, diminishing or dynamic stepsize rules and under a homogeneous assumption and the Hölder condition. To economize on the computation cost of subgradients of a large number of component functions, we further propose a randomized incremental quasi-subgradient method, in which only one component function is randomly selected to construct the subgradient direction at each iteration. The convergence properties are obtained in terms of function values and iterates with probability 1. The proposed incremental quasi-subgradient methods are applied to solve the quasi-convex feasibility problem and the sum of ratios problem, as well as the multiple Cobb–Douglas productions efficiency problem, and the numerical results show that the proposed methods are efficient for solving the large-scale sum of ratios problem. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of global optimization, Dec. 2019, v. 75, no. 4, p. 1003-1028 | en_US |
dcterms.isPartOf | Journal of global optimization | en_US |
dcterms.issued | 2019-12 | - |
dc.identifier.scopus | 2-s2.0-85070921728 | - |
dc.identifier.eissn | 1573-2916 | en_US |
dc.description.validate | 202206 bcfc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | AMA-0269 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 20443036 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Yang_Incremental_Quasi-Subgradient_Methods.pdf | Pre-Published version | 1.33 MB | Adobe PDF | View/Open |
Page views
49
Last Week
0
0
Last month
Citations as of May 19, 2024
Downloads
58
Citations as of May 19, 2024
SCOPUSTM
Citations
10
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
9
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.