IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v181y2019i1d10.1007_s10957-018-1379-1.html
   My bibliography  Save this article

Characterizations of Solution Sets of Differentiable Quasiconvex Programming Problems

Author

Listed:
  • Vsevolod I. Ivanov

    (Technical University of Varna)

Abstract

In this paper, we study some problems with a continuously differentiable and quasiconvex objective function. We prove that exactly one of the following two alternatives holds: (I) the gradient of the objective function is different from zero over the solution set, and the normalized gradient is constant over it; (II) the gradient of the objective function is equal to zero over the solution set. As a consequence, we obtain characterizations of the solution set of a program with a continuously differentiable and quasiconvex objective function, provided that one of the solutions is known. We also derive Lagrange multiplier characterizations of the solutions set of an inequality constrained problem with continuously differentiable objective function and differentiable constraints, which are all quasiconvex on some convex set, not necessarily open. We compare our results with the previous ones. Several examples are provided.

Suggested Citation

  • Vsevolod I. Ivanov, 2019. "Characterizations of Solution Sets of Differentiable Quasiconvex Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 144-162, April.
    • Handle: RePEc:spr:joptap:v:181:y:2019:i:1:d:10.1007_s10957-018-1379-1
    DOI: 10.1007/s10957-018-1379-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-018-1379-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-018-1379-1?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. Jeyakumar, V. & Lee, G.M. & Dinh, N., 2006. "Characterizations of solution sets of convex vector minimization problems," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1380-1395, November.
    2. V. Jeyakumar & G. M. Lee & N. Dinh, 2004. "Lagrange Multiplier Conditions Characterizing the Optimal Solution Sets of Cone-Constrained Convex Programs," Journal of Optimization Theory and Applications, Springer, vol. 123(1), pages 83-103, October.
    3. Satoshi Suzuki & Daishi Kuroiwa, 2015. "Characterizations of the solution set for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential," Journal of Global Optimization, Springer, vol. 62(3), pages 431-441, July.
    4. X. M. Yang, 2009. "On Characterizing the Solution Sets of Pseudoinvex Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 140(3), pages 537-542, March.
    5. Vsevolod I. Ivanov, 2013. "Optimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 65-84, July.
    6. Vsevolod Ivanov, 2013. "Characterizations of pseudoconvex functions and semistrictly quasiconvex ones," Journal of Global Optimization, Springer, vol. 57(3), pages 677-693, November.
    7. V. I. Ivanov, 2010. "Optimization and Variational Inequalities with Pseudoconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 146(3), pages 602-616, September.
    8. J.P. Penot, 2003. "Characterization of Solution Sets of Quasiconvex Programs," Journal of Optimization Theory and Applications, Springer, vol. 117(3), pages 627-636, June.
    9. T. Son & N. Dinh, 2008. "Characterizations of optimal solution sets of convex infinite programs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 147-163, July.
    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. Vsevolod I. Ivanov, 2020. "Characterization of Radially Lower Semicontinuous Pseudoconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 368-383, February.
    2. Kin Keung Lai & Shashi Kant Mishra & Sanjeev Kumar Singh & Mohd Hassan, 2022. "Stationary Conditions and Characterizations of Solution Sets for Interval-Valued Tightened Nonlinear Problems," Mathematics, MDPI, vol. 10(15), pages 1-16, August.

    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. Satoshi Suzuki & Daishi Kuroiwa, 2015. "Characterizations of the solution set for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential," Journal of Global Optimization, Springer, vol. 62(3), pages 431-441, July.
    2. Satoshi Suzuki, 2019. "Optimality Conditions and Constraint Qualifications for Quasiconvex Programming," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 963-976, December.
    3. Xiangkai Sun & Kok Lay Teo & Liping Tang, 2019. "Dual Approaches to Characterize Robust Optimal Solution Sets for a Class of Uncertain Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 182(3), pages 984-1000, September.
    4. Kin Keung Lai & Shashi Kant Mishra & Sanjeev Kumar Singh & Mohd Hassan, 2022. "Stationary Conditions and Characterizations of Solution Sets for Interval-Valued Tightened Nonlinear Problems," Mathematics, MDPI, vol. 10(15), pages 1-16, August.
    5. V. Jeyakumar & G. M. Lee & G. Li, 2015. "Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 164(2), pages 407-435, February.
    6. Vsevolod I. Ivanov, 2013. "Optimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 65-84, July.
    7. Vsevolod I. Ivanov, 2020. "Characterization of Radially Lower Semicontinuous Pseudoconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 368-383, February.
    8. S. K. Mishra & B. B. Upadhyay & Le Thi Hoai An, 2014. "Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 763-777, March.
    9. X. M. Yang, 2009. "On Characterizing the Solution Sets of Pseudoinvex Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 140(3), pages 537-542, March.
    10. Nader Kanzi & Majid Soleimani-damaneh, 2020. "Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization," Journal of Global Optimization, Springer, vol. 77(3), pages 627-641, July.
    11. N. V. Tuyen & C.-F. Wen & T. Q. Son, 2022. "An approach to characterizing $$\epsilon $$ ϵ -solution sets of convex programs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 249-269, July.
    12. 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.
    13. 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.
    14. T. Son & D. Kim, 2013. "ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints," Journal of Global Optimization, Springer, vol. 57(2), pages 447-465, October.
    15. Villacorta, Kely D.V. & Oliveira, P. Roberto, 2011. "An interior proximal method in vector optimization," European Journal of Operational Research, Elsevier, vol. 214(3), pages 485-492, November.
    16. Mohammad Taghi Nadi & Jafar Zafarani, 2023. "Second-order characterization of convex mappings in Banach spaces and its applications," Journal of Global Optimization, Springer, vol. 86(4), pages 1005-1023, August.
    17. Qamrul Hasan Ansari & Mahboubeh Rezaei, 2012. "Invariant Pseudolinearity with Applications," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 587-601, June.
    18. D. H. Fang & Y. Zhang, 2018. "Extended Farkas’s Lemmas and Strong Dualities for Conic Programming Involving Composite Functions," Journal of Optimization Theory and Applications, Springer, vol. 176(2), pages 351-376, February.
    19. H. Luo & X. Huang & J. Peng, 2012. "Generalized weak sharp minima in cone-constrained convex optimization with applications," Computational Optimization and Applications, Springer, vol. 53(3), pages 807-821, December.
    20. Jean-Paul Penot, 2015. "Projective dualities for quasiconvex problems," Journal of Global Optimization, Springer, vol. 62(3), pages 411-430, July.

    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:spr:joptap:v:181:y:2019:i:1:d:10.1007_s10957-018-1379-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.