IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v141y2009i2d10.1007_s10957-008-9475-2.html
   My bibliography  Save this article

ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints

Author

Listed:
  • T. Q. Son

    (Nhatrang Teacher College)

  • J. J. Strodiot

    (University of Namur (FUNDP))

  • V. H. Nguyen

    (University of Namur (FUNDP))

Abstract

In this paper, ε-optimality conditions are given for a nonconvex programming problem which has an infinite number of constraints. The objective function and the constraint functions are supposed to be locally Lipschitz on a Banach space. In a first part, we introduce the concept of regular ε-solution and propose a generalization of the Karush-Kuhn-Tucker conditions. These conditions are up to ε and are obtained by weakening the classical complementarity conditions. Furthermore, they are satisfied without assuming any constraint qualification. Then, we prove that these conditions are also sufficient for ε-optimality when the constraints are convex and the objective function is ε-semiconvex. In a second part, we define quasisaddlepoints associated with an ε-Lagrangian functional and we investigate their relationships with the generalized KKT conditions. In particular, we formulate a Wolfe-type dual problem which allows us to present ε-duality theorems and relationships between the KKT conditions and regular ε-solutions for the dual. Finally, we apply these results to two important infinite programming problems: the cone-constrained convex problem and the semidefinite programming problem.

Suggested Citation

  • T. Q. Son & J. J. Strodiot & V. H. Nguyen, 2009. "ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints," Journal of Optimization Theory and Applications, Springer, vol. 141(2), pages 389-409, May.
    • Handle: RePEc:spr:joptap:v:141:y:2009:i:2:d:10.1007_s10957-008-9475-2
    DOI: 10.1007/s10957-008-9475-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-008-9475-2
    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-008-9475-2?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. N. Dinh & V. Jeyakumar & G. M. Lee, 2005. "Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 125(1), pages 85-112, April.
    2. Lopez, Marco & Still, Georg, 2007. "Semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 180(2), pages 491-518, July.
    3. 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.
    4. J. Dutta, 2005. "Necessary optimality conditions and saddle points for approximate optimization in banach spaces," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(1), pages 127-143, June.
    5. 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.
    6. 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)

    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. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.
    2. 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.
    3. 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.
    4. Lopez, Marco & Still, Georg, 2007. "Semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 180(2), pages 491-518, July.
    5. Peter Kirst & Oliver Stein, 2016. "Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 1079-1109, June.
    6. 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.
    7. Hatim Djelassi & Alexander Mitsos, 2017. "A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs," Journal of Global Optimization, Springer, vol. 68(2), pages 227-253, June.
    8. O. Stein, 2004. "On Constraint Qualifications in Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 121(3), pages 647-671, June.
    9. 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.
    10. R. Paulavičius & C. S. Adjiman, 2020. "New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm," Journal of Global Optimization, Springer, vol. 77(2), pages 197-225, June.
    11. Souvik Das & Ashwin Aravind & Ashish Cherukuri & Debasish Chatterjee, 2022. "Near-optimal solutions of convex semi-infinite programs via targeted sampling," Annals of Operations Research, Springer, vol. 318(1), pages 129-146, November.
    12. Aguiar, Victor H. & Kashaev, Nail & Allen, Roy, 2023. "Prices, profits, proxies, and production," Journal of Econometrics, Elsevier, vol. 235(2), pages 666-693.
    13. Volker Maag, 2015. "A collision detection approach for maximizing the material utilization," Computational Optimization and Applications, Springer, vol. 61(3), pages 761-781, July.
    14. Li Wang & Feng Guo, 2014. "Semidefinite relaxations for semi-infinite polynomial programming," Computational Optimization and Applications, Springer, vol. 58(1), pages 133-159, May.
    15. 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.
    16. S. Dempe & S. Franke, 2016. "On the solution of convex bilevel optimization problems," Computational Optimization and Applications, Springer, vol. 63(3), pages 685-703, April.
    17. Shaojian Qu & Mark Goh & Soon-Yi Wu & Robert Souza, 2014. "Multiobjective DC programs with infinite convex constraints," Journal of Global Optimization, Springer, vol. 59(1), pages 41-58, May.
    18. 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.
    19. Josef Kallrath & Steffen Rebennack, 2014. "Cutting ellipses from area-minimizing rectangles," Journal of Global Optimization, Springer, vol. 59(2), pages 405-437, July.
    20. 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.

    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:141:y:2009:i:2:d:10.1007_s10957-008-9475-2. 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.