IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v117y2003i3d10.1023_a1023957924086.html
   My bibliography  Save this article

Lagrangian Approach to Quasiconvex Programing

Author

Listed:
  • J.P. Penot

    (University of Pau)

Abstract

For a mathematical programming problem, we consider a Lagrangian approach inspired by quasiconvex duality, but as close as possible to the usual convex Lagrangian. We focus our attention on the set of multipliers and we look for their interpretation as generalized derivatives of the performance function associated with a simple perturbation of the given problem. We do not use quasiconvex dualities, but simple direct arguments.

Suggested Citation

  • J.P. Penot, 2003. "Lagrangian Approach to Quasiconvex Programing," Journal of Optimization Theory and Applications, Springer, vol. 117(3), pages 637-647, June.
    • Handle: RePEc:spr:joptap:v:117:y:2003:i:3:d:10.1023_a:1023957924086
    DOI: 10.1023/A:1023957924086
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1023957924086
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1023957924086?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. Jean-Paul Penot & Michel Volle, 1990. "On Quasi-Convex Duality," Mathematics of Operations Research, INFORMS, vol. 15(4), pages 597-625, November.
    2. 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.
    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. N. T. H. Linh & J.-P. Penot, 2012. "Generalized Affine Functions and Generalized Differentials," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 321-338, 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. 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.
    2. Jean-Paul Penot, 2015. "Projective dualities for quasiconvex problems," Journal of Global Optimization, Springer, vol. 62(3), pages 411-430, July.
    3. Elisa Mastrogiacomo & Emanuela Rosazza Gianin, 2015. "Portfolio Optimization with Quasiconvex Risk Measures," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 1042-1059, October.
    4. 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.
    5. 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.
    6. 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.
    7. Wang, Wei & Xu, Huifu & Ma, Tiejun, 2023. "Optimal scenario-dependent multivariate shortfall risk measure and its application in risk capital allocation," European Journal of Operational Research, Elsevier, vol. 306(1), pages 322-347.
    8. 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.
    9. Maria Arduca & Cosimo Munari, 2021. "Risk measures beyond frictionless markets," Papers 2111.08294, arXiv.org.
    10. Simone Cerreia-Vioglio & Fabio Maccheroni & Massimo Marinacci & Luigi Montrucchio, 2008. "Complete Monotone Quasiconcave Duality," Carlo Alberto Notebooks 80, Collegio Carlo Alberto.
    11. Satoshi Suzuki, 2010. "Set containment characterization with strict and weak quasiconvex inequalities," Journal of Global Optimization, Springer, vol. 47(2), pages 273-285, June.
    12. M. Volle & J. E. Martínez-Legaz & J. Vicente-Pérez, 2015. "Duality for Closed Convex Functions and Evenly Convex Functions," Journal of Optimization Theory and Applications, Springer, vol. 167(3), pages 985-997, December.
    13. Cerreia-Vioglio, S. & Maccheroni, F. & Marinacci, M. & Montrucchio, L., 2011. "Uncertainty averse preferences," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1275-1330, July.
    14. Satoshi Suzuki & Daishi Kuroiwa, 2017. "Duality Theorems for Separable Convex Programming Without Qualifications," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 669-683, February.
    15. Satoshi Suzuki & Daishi Kuroiwa, 2013. "Some constraint qualifications for quasiconvex vector-valued systems," Journal of Global Optimization, Springer, vol. 55(3), pages 539-548, March.
    16. Khanh, Phan Quoc & Quyen, Ho Thuc & Yao, Jen-Chih, 2011. "Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials," European Journal of Operational Research, Elsevier, vol. 212(2), pages 235-241, July.
    17. Marco Frittelli & Marco Maggis, 2017. "Disentangling Price, Risk and Model Risk: V&R measures," Papers 1703.01329, arXiv.org, revised Jul 2017.
    18. Frittelli Marco & Maggis Marco, 2014. "Complete duality for quasiconvex dynamic risk measures on modules of the Lp-type," Statistics & Risk Modeling, De Gruyter, vol. 31(1), pages 103-128, March.
    19. Jean-Paul Penot & Pham Hong Quang, 2011. "Cutting Plane Algorithms and Approximate Lower Subdifferentiability," Journal of Optimization Theory and Applications, Springer, vol. 148(3), pages 455-470, March.
    20. 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.

    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:117:y:2003:i:3:d:10.1023_a:1023957924086. 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.