IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v45y2009i4p615-629.html
   My bibliography  Save this article

Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions

Author

Listed:
  • Qingxiang Zhang

Abstract

No abstract is available for this item.

Suggested Citation

  • Qingxiang Zhang, 2009. "Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions," Computational Optimization and Applications, Springer, vol. 45(4), pages 615-629, December.
    • Handle: RePEc:spr:coopap:v:45:y:2009:i:4:p:615-629
    DOI: 10.1007/s10898-009-9400-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-009-9400-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-009-9400-8?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. D. Bhatia & A. Mehra, 1999. "Optimality Conditions and Duality Involving Arcwise Connected and Generalized Arcwise Connected Functions," Journal of Optimization Theory and Applications, Springer, vol. 100(1), pages 181-194, January.
    2. J. J. Rückmann & A. Shapiro, 1999. "First-Order Optimality Conditions in Generalized Semi-Infinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 101(3), pages 677-691, 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. Francisco Guerra-Vázquez & Jan-J. Rückmann & Ralf Werner, 2012. "On saddle points in nonconvex semi-infinite programming," Journal of Global Optimization, Springer, vol. 54(3), pages 433-447, November.

    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. Xiaoqi Yang & Zhangyou Chen & Jinchuan Zhou, 2016. "Optimality Conditions for Semi-Infinite and Generalized Semi-Infinite Programs Via Lower Order Exact Penalty Functions," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 984-1012, June.
    2. O. Stein, 2004. "On Constraint Qualifications in Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 121(3), pages 647-671, June.
    3. Kanzi, N. & Nobakhtian, S., 2010. "Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems," European Journal of Operational Research, Elsevier, vol. 205(2), pages 253-261, September.
    4. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.
    5. O. Kostyukova & T. Tchemisova, 2012. "Implicit optimality criterion for convex SIP problem with box constrained index set," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(2), pages 475-502, July.
    6. Alexander Mitsos & Angelos Tsoukalas, 2015. "Global optimization of generalized semi-infinite programs via restriction of the right hand side," Journal of Global Optimization, Springer, vol. 61(1), pages 1-17, January.
    7. Tadeusz Antczak & Najeeb Abdulaleem, 2021. "E-differentiable minimax programming under E-convexity," Annals of Operations Research, Springer, vol. 300(1), pages 1-22, May.
    8. J. J. Ye & S. Y. Wu, 2008. "First Order Optimality Conditions for Generalized Semi-Infinite Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 419-434, May.
    9. Hong Yang & Angang Cui, 2023. "The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with ( B K ,ρ )−Invexity," Mathematics, MDPI, vol. 11(20), pages 1-13, October.
    10. Pál Burai, 2014. "Local–Global Minimum Property in Unconstrained Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(1), pages 34-46, July.
    11. Oliver Stein, 2001. "First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 565-582, August.
    12. Stuart M. Harwood & Paul I. Barton, 2017. "How to solve a design centering problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(1), pages 215-254, August.
    13. Stein, Oliver & Still, Georg, 2002. "On generalized semi-infinite optimization and bilevel optimization," European Journal of Operational Research, Elsevier, vol. 142(3), pages 444-462, November.
    14. G. Stein & G. Still, 2000. "On Optimality Conditions for Generalized Semi-Infinite Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 104(2), pages 443-458, February.
    15. Olga Kostyukova & Tatiana Tchemisova, 2017. "Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 76-103, October.
    16. J.Y. Fu & Y.H. Wang, 2003. "Arcwise Connected Cone-Convex Functions and Mathematical Programming," Journal of Optimization Theory and Applications, Springer, vol. 118(2), pages 339-352, August.
    17. O. I. Kostyukova & T. V. Tchemisova & S. A. Yermalinskaya, 2010. "Convex Semi-Infinite Programming: Implicit Optimality Criterion Based on the Concept of Immobile Indices," Journal of Optimization Theory and Applications, Springer, vol. 145(2), pages 325-342, May.
    18. Hatim Djelassi & Moll Glass & Alexander Mitsos, 2019. "Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints," Journal of Global Optimization, Springer, vol. 75(2), pages 341-392, October.
    19. Geletu, Abebe & Hoffmann, Armin, 2004. "A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization," European Journal of Operational Research, Elsevier, vol. 157(1), pages 3-15, August.

    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:coopap:v:45:y:2009:i:4:p:615-629. 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.