IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v159y2013i2d10.1007_s10957-013-0335-3.html
   My bibliography  Save this article

A Lower Bound for the Penalty Parameter in the Exact Minimax Penalty Function Method for Solving Nondifferentiable Extremum Problems

Author

Listed:
  • T. Antczak

    (University of Łódź)

Abstract

In the paper, we consider the exact minimax penalty function method used for solving a general nondifferentiable extremum problem with both inequality and equality constraints. We analyze the relationship between an optimal solution in the given constrained extremum problem and a minimizer in its associated penalized optimization problem with the exact minimax penalty function under the assumption of convexity of the functions constituting the considered optimization problem (with the exception of those equality constraint functions for which the associated Lagrange multipliers are negative—these functions should be assumed to be concave). The lower bound of the penalty parameter is given such that, for every value of the penalty parameter above the threshold, the equivalence holds between the set of optimal solutions in the given extremum problem and the set of minimizers in its associated penalized optimization problem with the exact minimax penalty function.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:159:y:2013:i:2:d:10.1007_s10957-013-0335-3
    DOI: 10.1007/s10957-013-0335-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-013-0335-3
    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-013-0335-3?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. Tadeusz Antczak, 2010. "THEl1PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(05), pages 559-576.
    2. Willard I. Zangwill, 1967. "Non-Linear Programming Via Penalty Functions," Management Science, INFORMS, vol. 13(5), pages 344-358, January.
    3. Antczak, Tadeusz, 2009. "Exact penalty functions method for mathematical programming problems involving invex functions," European Journal of Operational Research, Elsevier, vol. 198(1), pages 29-36, October.
    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. Tadeusz Antczak & Najeeb Abdulaleem, 2021. "E-differentiable minimax programming under E-convexity," Annals of Operations Research, Springer, vol. 300(1), pages 1-22, May.
    2. 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.

    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. T. Antczak, 2018. "Exactness Property of the Exact Absolute Value Penalty Function Method for Solving Convex Nondifferentiable Interval-Valued Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 205-224, January.
    2. Tadeusz Antczak & Najeeb Abdulaleem, 2023. "On the exactness and the convergence of the $$l_{1}$$ l 1 exact penalty E-function method for E-differentiable optimization problems," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1331-1359, September.
    3. Kaiwen Meng & Xiaoqi Yang, 2015. "First- and Second-Order Necessary Conditions Via Exact Penalty Functions," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 720-752, June.
    4. M. V. Dolgopolik, 2018. "A Unified Approach to the Global Exactness of Penalty and Augmented Lagrangian Functions I: Parametric Exactness," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 728-744, March.
    5. Savin Treanţă & Tadeusz Antczak & Tareq Saeed, 2023. "Connections between Non-Linear Optimization Problems and Associated Variational Inequalities," Mathematics, MDPI, vol. 11(6), pages 1-12, March.
    6. Antczak, Tadeusz, 2009. "Exact penalty functions method for mathematical programming problems involving invex functions," European Journal of Operational Research, Elsevier, vol. 198(1), pages 29-36, October.
    7. Tiago Andrade & Nikita Belyak & Andrew Eberhard & Silvio Hamacher & Fabricio Oliveira, 2022. "The p-Lagrangian relaxation for separable nonconvex MIQCQP problems," Journal of Global Optimization, Springer, vol. 84(1), pages 43-76, September.
    8. Pan, Yan & Duan, Fabing & Xu, Liyan & Chapeau-Blondeau, François, 2019. "Benefits of noise in M-estimators: Optimal noise level and probability density," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 534(C).
    9. A. J. Zaslavski, 2014. "An Approximate Exact Penalty in Constrained Vector Optimization on Metric Spaces," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 649-664, August.
    10. Ellen H. Fukuda & L. M. Graña Drummond & Fernanda M. P. Raupp, 2016. "An external penalty-type method for multicriteria," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 493-513, July.
    11. D.P. Bertsekas & A.E. Ozdaglar, 2002. "Pseudonormality and a Lagrange Multiplier Theory for Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 114(2), pages 287-343, August.
    12. Changyu Wang & Cheng Ma & Jinchuan Zhou, 2014. "A new class of exact penalty functions and penalty algorithms," Journal of Global Optimization, Springer, vol. 58(1), pages 51-73, January.
    13. Duan Yaqiong & Lian Shujun, 2016. "Smoothing Approximation to the Square-Root Exact Penalty Function," Journal of Systems Science and Information, De Gruyter, vol. 4(1), pages 87-96, February.
    14. Rao, K.S. Rama & Sunderan, T. & Adiris, M. Ref'at, 2017. "Performance and design optimization of two model based wave energy permanent magnet linear generators," Renewable Energy, Elsevier, vol. 101(C), pages 196-203.
    15. Marco Corazza & Giovanni Fasano & Riccardo Gusso, 2011. "Particle Swarm Optimization with non-smooth penalty reformulation for a complex portfolio selection problem," Working Papers 2011_10, Department of Economics, University of Venice "Ca' Foscari".
    16. Giorgio Giorgi & Bienvenido Jiménez & Vicente Novo, 2014. "Some Notes on Approximate Optimality Conditions in Scalar and Vector Optimization Problems," DEM Working Papers Series 095, University of Pavia, Department of Economics and Management.
    17. 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.
    18. X. Q. Yang & Y. Y. Zhou, 2010. "Second-Order Analysis of Penalty Function," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 445-461, August.
    19. Amaioua, Nadir & Audet, Charles & Conn, Andrew R. & Le Digabel, Sébastien, 2018. "Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm," European Journal of Operational Research, Elsevier, vol. 268(1), pages 13-24.
    20. Marco Corazza & Stefania Funari & Riccardo Gusso, 2012. "An evolutionary approach to preference disaggregation in a MURAME-based credit scoring problem," Working Papers 5, Venice School of Management - Department of Management, Università Ca' Foscari Venezia.

    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:159:y:2013:i:2:d:10.1007_s10957-013-0335-3. 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.