IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v282y2020i2p428-437.html
   My bibliography  Save this article

Fixed point quasiconvex subgradient method

Author

Listed:
  • Hishinuma, Kazuhiro
  • Iiduka, Hideaki

Abstract

Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional objective functions, is an important instance. Subgradient methods and their variants are useful ways for solving these problems efficiently. Many complicated constraint sets onto which it is hard to compute the metric projections in a realistic amount of time appear in these applications. This implies that the existing methods cannot be applied to quasiconvex optimization over a complicated set. Meanwhile, thanks to fixed point theory, we can construct a computable nonexpansive mapping whose fixed point set coincides with a complicated constraint set. This paper proposes an algorithm that uses a computable nonexpansive mapping for solving a constrained quasiconvex optimization problem. We provide convergence analyses for constant diminishing step-size rules. Numerical comparisons between the proposed algorithm and an existing algorithm show that the proposed algorithm runs stably and quickly even when the running time of the existing algorithm exceeds the time limit.

Suggested Citation

  • Hishinuma, Kazuhiro & Iiduka, Hideaki, 2020. "Fixed point quasiconvex subgradient method," European Journal of Operational Research, Elsevier, vol. 282(2), pages 428-437.
    • Handle: RePEc:eee:ejores:v:282:y:2020:i:2:p:428-437
    DOI: 10.1016/j.ejor.2019.09.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719307945
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.09.037?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Stephen P. Bradley & Sherwood C. Frey, 1974. "Fractional Programming with Homogeneous Functions," Operations Research, INFORMS, vol. 22(2), pages 350-357, April.
    2. Iiduka, Hideaki, 2016. "Proximal point algorithms for nonsmooth convex optimization with fixed point constraints," European Journal of Operational Research, Elsevier, vol. 253(2), pages 503-513.
    3. Lee, Chia-Yen & Johnson, Andrew L. & Moreno-Centeno, Erick & Kuosmanen, Timo, 2013. "A more efficient algorithm for Convex Nonparametric Least Squares," European Journal of Operational Research, Elsevier, vol. 227(2), pages 391-400.
    4. Larsson, Torbjorn & Patriksson, Michael & Stromberg, Ann-Brith, 1996. "Conditional subgradient optimization -- Theory and applications," European Journal of Operational Research, Elsevier, vol. 88(2), pages 382-403, January.
    5. Hu, Yaohua & Yang, Xiaoqi & Sim, Chee-Khian, 2015. "Inexact subgradient methods for quasi-convex optimization problems," European Journal of Operational Research, Elsevier, vol. 240(2), pages 315-327.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A. Kabgani & F. Lara, 2023. "Semistrictly and neatly quasiconvex programming using lower global subdifferentials," Journal of Global Optimization, Springer, vol. 86(4), pages 845-865, August.
    2. Alireza Kabgani, 2021. "Characterization of Nonsmooth Quasiconvex Functions and their Greenberg–Pierskalla’s Subdifferentials Using Semi-Quasidifferentiability notion," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 666-678, May.
    3. Hu, Yaohua & Li, Gongnong & Yu, Carisa Kwok Wai & Yip, Tsz Leung, 2022. "Quasi-convex feasibility problems: Subgradient methods and convergence rates," European Journal of Operational Research, Elsevier, vol. 298(1), pages 45-58.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yaohua Hu & Carisa Kwok Wai Yu & Xiaoqi Yang, 2019. "Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions," Journal of Global Optimization, Springer, vol. 75(4), pages 1003-1028, December.
    2. Hu, Yaohua & Li, Gongnong & Yu, Carisa Kwok Wai & Yip, Tsz Leung, 2022. "Quasi-convex feasibility problems: Subgradient methods and convergence rates," European Journal of Operational Research, Elsevier, vol. 298(1), pages 45-58.
    3. Yaohua Hu & Jiawen Li & Carisa Kwok Wai Yu, 2020. "Convergence rates of subgradient methods for quasi-convex optimization problems," Computational Optimization and Applications, Springer, vol. 77(1), pages 183-212, September.
    4. Hu, Yaohua & Yang, Xiaoqi & Sim, Chee-Khian, 2015. "Inexact subgradient methods for quasi-convex optimization problems," European Journal of Operational Research, Elsevier, vol. 240(2), pages 315-327.
    5. Shinji Yamada & Akiko Takeda, 2018. "Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization," Journal of Global Optimization, Springer, vol. 71(2), pages 313-339, June.
    6. Maingé, Paul-Emile, 2014. "A viscosity method with no spectral radius requirements for the split common fixed point problem," European Journal of Operational Research, Elsevier, vol. 235(1), pages 17-27.
    7. Tsionas, Mike G. & Izzeldin, Marwan, 2018. "Smooth approximations to monotone concave functions in production analysis: An alternative to nonparametric concave least squares," European Journal of Operational Research, Elsevier, vol. 271(3), pages 797-807.
    8. Fei Han & Jian Wang & Lingli Huang & Yan Li & Liu He, 2023. "Modeling Impacts of Implementation Policies of Tradable Credit Schemes on Traffic Congestion in the Context of Traveler’s Cognitive Illusion," Sustainability, MDPI, vol. 15(15), pages 1-18, July.
    9. Dey, Shibshankar & Kim, Cheolmin & Mehrotra, Sanjay, 2024. "An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation," European Journal of Operational Research, Elsevier, vol. 315(3), pages 980-990.
    10. K. Hervé Dakpo & Yann Desjeux & Laure Latruffe, 2023. "Cost of abating excess nitrogen on wheat plots in France: An assessment with multi‐technology modelling," Journal of Agricultural Economics, Wiley Blackwell, vol. 74(3), pages 800-815, September.
    11. Stefan Seifert, 2015. "Measuring Productivity When Technologies Are Heterogeneous: A Semi-Parametric Approach for Electricity Generation," Discussion Papers of DIW Berlin 1526, DIW Berlin, German Institute for Economic Research.
    12. Lee, Chia-Yen & Wang, Ke, 2019. "Nash marginal abatement cost estimation of air pollutant emissions using the stochastic semi-nonparametric frontier," European Journal of Operational Research, Elsevier, vol. 273(1), pages 390-400.
    13. Pang Du & Christopher F. Parmeter & Jeffrey S. Racine, 2012. "Nonparametric Kernel Regression with Multiple Predictors and Multiple Shape Constraints," Department of Economics Working Papers 2012-08, McMaster University.
    14. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    15. Chia-Yen Lee, 2017. "Directional marginal productivity: a foundation of meta-data envelopment analysis," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(5), pages 544-555, May.
    16. Tsionas, Mike G., 2022. "Convex non-parametric least squares, causal structures and productivity," European Journal of Operational Research, Elsevier, vol. 303(1), pages 370-387.
    17. Wang, Yongqiao & Wang, Shouyang & Dang, Chuangyin & Ge, Wenxiu, 2014. "Nonparametric quantile frontier estimation under shape restriction," European Journal of Operational Research, Elsevier, vol. 232(3), pages 671-678.
    18. Satoshi Suzuki, 2021. "Karush–Kuhn–Tucker type optimality condition for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential," Journal of Global Optimization, Springer, vol. 79(1), pages 191-202, January.
    19. Seifert, Stefan, 2015. "Productivity Growth and its Sources - A StoNED Metafrontier Analyis of the German Electricity Generating Sector," VfS Annual Conference 2015 (Muenster): Economic Development - Theory and Policy 112975, Verein für Socialpolitik / German Economic Association.
    20. Xiaoqi Yang & Chenchen Zu, 2022. "Convergence of Inexact Quasisubgradient Methods with Extrapolation," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 676-703, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:282:y:2020:i:2:p:428-437. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.