IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v169y2016i1d10.1007_s10957-015-0812-y.html
   My bibliography  Save this article

An Exact Minimax Penalty Function Method and Saddle Point Criteria for Nonsmooth Convex Vector Optimization Problems

Author

Listed:
  • Anurag Jayswal

    (Indian School of Mines)

  • Sarita Choudhury

    (Indian School of Mines)

Abstract

In this paper, the exact minimax penalty function method is applied to solve constrained multiobjective optimization problems involving locally Lipschitz functions. The criteria for a saddle point for the original vector optimization problem are studied with the help of the penalized unconstrained vector optimization problem. Furthermore, we determine the conditions for which the (weak) efficient solutions of the vector optimization problem are equivalent to those of the associated, penalized unconstrained vector optimization problem. Some examples of nonsmooth multiobjective problems solved by using the exact minimax penalty method are presented to illustrate the results established in the paper.

Suggested Citation

  • Anurag Jayswal & Sarita Choudhury, 2016. "An Exact Minimax Penalty Function Method and Saddle Point Criteria for Nonsmooth Convex Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 169(1), pages 179-199, April.
    • Handle: RePEc:spr:joptap:v:169:y:2016:i:1:d:10.1007_s10957-015-0812-y
    DOI: 10.1007/s10957-015-0812-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-015-0812-y
    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-015-0812-y?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. M. K. Ghosh & A. J. Shaiju, 2004. "Existence of Value and Saddle Point in Infinite-Dimensional Differential Games," Journal of Optimization Theory and Applications, Springer, vol. 121(2), pages 301-325, May.
    2. T. Antczak, 2013. "A Lower Bound for the Penalty Parameter in the Exact Minimax Penalty Function Method for Solving Nondifferentiable Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 159(2), pages 437-453, November.
    3. G. Di Pillo & S. Lucidi & F. Rinaldi, 2012. "An approach to constrained global optimization based on exact penalty functions," Journal of Global Optimization, Springer, vol. 54(2), pages 251-260, October.
    4. S. Lucidi & F. Rinaldi, 2010. "Exact Penalty Functions for Nonlinear Integer Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 145(3), pages 479-488, June.
    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. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2013. "A new class of functions for measuring solution integrality in the Feasibility Pump approach: Complete Results," DIAG Technical Reports 2013-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    2. G. Di Pillo & G. Liuzzi & S. Lucidi & V. Piccialli & F. Rinaldi, 2016. "A DIRECT-type approach for derivative-free constrained global optimization," Computational Optimization and Applications, Springer, vol. 65(2), pages 361-397, November.
    3. Dominik Garmatter & Margherita Porcelli & Francesco Rinaldi & Martin Stoll, 2023. "An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations," Computational Optimization and Applications, Springer, vol. 84(1), pages 191-223, January.
    4. Md Saiful Islam & Md Sarowar Morshed & Md. Noor-E-Alam, 2022. "A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3023-3041, November.
    5. Ana Maria A. C. Rocha & M. Fernanda P. Costa & Edite M. G. P. Fernandes, 2017. "On a smoothed penalty-based algorithm for global optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 561-585, November.
    6. Ana Rocha & M. Costa & Edite Fernandes, 2014. "A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues," Journal of Global Optimization, Springer, vol. 60(2), pages 239-263, October.
    7. Stefano Lucidi & Francesco Rinaldi, 2010. "An Exact Penalty Global Optimization Approach for Mixed-Integer Programming Problems," DIS Technical Reports 2010-17, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    8. M. Ramaswamy & A. J. Shaiju, 2009. "Construction of Approximate Saddle-Point Strategies for Differential Games in a Hilbert Space," Journal of Optimization Theory and Applications, Springer, vol. 141(2), pages 349-370, May.
    9. Gianni Pillo & Stefano Lucidi & Francesco Rinaldi, 2015. "A Derivative-Free Algorithm for Constrained Global Optimization Based on Exact Penalty Functions," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 862-882, March.
    10. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2010. "Feasibility Pump-Like Heuristics for Mixed Integer Problems," DIS Technical Reports 2010-15, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    11. M. Fernanda P. Costa & Rogério B. Francisco & Ana Maria A. C. Rocha & Edite M. G. P. Fernandes, 2017. "Theoretical and Practical Convergence of a Self-Adaptive Penalty Algorithm for Constrained Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 875-893, September.
    12. M. Santis & F. Rinaldi, 2012. "Continuous Reformulations for Zero–One Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 153(1), pages 75-84, April.
    13. M. Joseane F. G. Macêdo & Elizabeth W. Karas & M. Fernanda P. Costa & Ana Maria A. C. Rocha, 2020. "Filter-based stochastic algorithm for global optimization," Journal of Global Optimization, Springer, vol. 77(4), pages 777-805, August.
    14. C. J. Price & M. Reale & B. L. Robertson, 2016. "Stochastic filter methods for generally constrained global optimization," Journal of Global Optimization, Springer, vol. 65(3), pages 441-456, July.
    15. Hager, William W. & Hungerford, James T., 2015. "Continuous quadratic programming formulations of optimization problems on graphs," European Journal of Operational Research, Elsevier, vol. 240(2), pages 328-337.
    16. M. Fernanda P. Costa & Ana Maria A. C. Rocha & Edite M. G. P. Fernandes, 2018. "Filter-based DIRECT method for constrained global optimization," Journal of Global Optimization, Springer, vol. 71(3), pages 517-536, July.
    17. Filippo Fabiani & Barbara Franci, 2023. "On Distributionally Robust Generalized Nash Games Defined over the Wasserstein Ball," Journal of Optimization Theory and Applications, Springer, vol. 199(1), pages 298-309, October.
    18. Tadeusz Antczak & Najeeb Abdulaleem, 2021. "E-differentiable minimax programming under E-convexity," Annals of Operations Research, Springer, vol. 300(1), pages 1-22, May.
    19. Ma, Cheng & Zhang, Liansheng, 2015. "On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 642-656.
    20. Ubaldo M. García-Palomares, 2020. "Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 599-625, October.

    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:169:y:2016:i:1:d:10.1007_s10957-015-0812-y. 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.