IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v49y2011i4p713-725.html
   My bibliography  Save this article

Necessary optimality conditions for nonsmooth semi-infinite programming problems

Author

Listed:
  • Nader Kanzi

Abstract

No abstract is available for this item.

Suggested Citation

  • Nader Kanzi, 2011. "Necessary optimality conditions for nonsmooth semi-infinite programming problems," Journal of Global Optimization, Springer, vol. 49(4), pages 713-725, April.
    • Handle: RePEc:spr:jglopt:v:49:y:2011:i:4:p:713-725
    DOI: 10.1007/s10898-010-9561-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-010-9561-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-010-9561-5?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. O. Stein, 2004. "On Constraint Qualifications in Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 121(3), pages 647-671, June.
    2. Lopez, Marco & Still, Georg, 2007. "Semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 180(2), pages 491-518, July.
    3. Rubén Puente & Virginia Vera de Serio, 1999. "Locally Farkas-Minkowski linear inequality systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(1), pages 103-121, 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. Li-Ping Pang & Jian Lv & Jin-He Wang, 2016. "Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 433-465, June.
    2. David Barilla & Giuseppe Caristi & Nader Kanzi, 2022. "Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 503-519, December.
    3. Giuseppe Caristi & Massimiliano Ferrara, 2017. "Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel–Penot subdifferential," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 103-113, November.
    4. 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.
    5. M. V. Dolgopolik, 2022. "DC Semidefinite programming and cone constrained DC optimization I: theory," Computational Optimization and Applications, Springer, vol. 82(3), pages 649-671, July.
    6. Alexander Y. Kruger & Marco A. López, 2012. "Stationarity and Regularity of Infinite Collections of Sets. Applications to Infinitely Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 390-416, 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. Li-Ping Pang & Jian Lv & Jin-He Wang, 2016. "Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 433-465, June.
    2. Li Wang & Feng Guo, 2014. "Semidefinite relaxations for semi-infinite polynomial programming," Computational Optimization and Applications, Springer, vol. 58(1), pages 133-159, May.
    3. S. Mishra & M. Jaiswal & H. Le Thi, 2012. "Nonsmooth semi-infinite programming problem using Limiting subdifferentials," Journal of Global Optimization, Springer, vol. 53(2), pages 285-296, June.
    4. Cao Thanh Tinh & Thai Doan Chuong, 2022. "Conic Linear Programming Duals for Classes of Quadratic Semi-Infinite Programs with Applications," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 570-596, August.
    5. Duarte, Belmiro P.M. & Sagnol, Guillaume & Wong, Weng Kee, 2018. "An algorithm based on semidefinite programming for finding minimax optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 119(C), pages 99-117.
    6. Nazih Abderrazzak Gadhi, 2019. "Necessary optimality conditions for a nonsmooth semi-infinite programming problem," Journal of Global Optimization, Springer, vol. 74(1), pages 161-168, May.
    7. Rafael Correa & Marco A. López & Pedro Pérez-Aros, 2023. "Optimality Conditions in DC-Constrained Mathematical Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1191-1225, September.
    8. Jan Schwientek & Tobias Seidel & Karl-Heinz Küfer, 2021. "A transformation-based discretization method for solving general semi-infinite optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 83-114, February.
    9. Engau, Alexander & Sigler, Devon, 2020. "Pareto solutions in multicriteria optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 357-368.
    10. Aguiar, Victor H. & Kashaev, Nail & Allen, Roy, 2023. "Prices, profits, proxies, and production," Journal of Econometrics, Elsevier, vol. 235(2), pages 666-693.
    11. David Mogalle & Philipp Seufert & Jan Schwientek & Michael Bortz & Karl-Heinz Küfer, 2024. "Computing T-optimal designs via nested semi-infinite programming and twofold adaptive discretization," Computational Statistics, Springer, vol. 39(5), pages 2451-2478, July.
    12. Hassan Bakhtiari & Hossein Mohebi, 2021. "Lagrange Multiplier Characterizations of Constrained Best Approximation with Infinite Constraints," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 814-835, June.
    13. Tran Van Su, 2023. "Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints," Journal of Global Optimization, Springer, vol. 85(3), pages 663-685, March.
    14. Mohammad R. Oskoorouchi & Hamid R. Ghaffari & Tamás Terlaky & Dionne M. Aleman, 2011. "An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application," Operations Research, INFORMS, vol. 59(5), pages 1184-1197, October.
    15. S. Rivaz & M. A. Yaghoobi & M. Hladík, 2016. "Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 237-253, September.
    16. Zhi Guo Feng & Fei Chen & Lin Chen & Ka Fai Cedric Yiu, 2020. "Optimality Analysis of a Class of Semi-infinite Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 398-411, August.
    17. Boris S. Mordukhovich & T. T. A. Nghia, 2014. "Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 301-324, May.
    18. J. O. Royset & E. Y. Pee, 2012. "Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 855-882, December.
    19. Sönke Behrends & Anita Schöbel, 2020. "Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 911-935, September.
    20. Holger Berthold & Holger Heitsch & René Henrion & Jan Schwientek, 2022. "On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(1), pages 1-37, 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:jglopt:v:49:y:2011:i:4:p:713-725. 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.