Skip to main content
Log in

An Approximate Exact Penalty for Vector Inequality-Constrained Minimization Problems

  • Published:
Vietnam Journal of Mathematics Aims and scope Submit manuscript

Abstract

In this paper, we use the penalty approach in order to study a class of vector inequality-constrained minimization problems on Banach spaces. A penalty function is said to have the generalized exact penalty property if there is a penalty coefficient for which approximate solutions of the unconstrained penalized problem are close enough to approximate solutions of the corresponding constrained problem. For our class of problems, we establish the generalized exact penalty property and obtain an estimation of the exact penalty.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Auslender, A.: Penalty and barrier methods: a unified framework. SIAM J. Optim. 10, 211–230 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Auslender, A.: Asymptotic analysis for penalty and barrier methods in variational inequalities. SIAM J. Control Optim. 37, 653–671 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Boukari, D., Fiacco, A.V.: Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993. Optim. 32, 301–334 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Burachik, R.S., Iusem, A.N., Melo, J.G.: Duality and exact penalization for general augmented Lagrangians. J. Optim. Theory Appl. 147, 125–140 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Burachik, R.S., Kaya, C.Y.: An augmented penalty function method with penalty parameter updates for nonconvex optimization. Nonlinear Anal. 75, 1158–1167 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Burke, J.V.: An exact penalization viewpoint of constrained optimization . SIAM J. Control Optim. 29, 968–998 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)

    MATH  Google Scholar 

  8. Di Pillo, G., Grippo, L.: Exact penalty functions in constrained optimization. SIAM J. Control Optim. 27, 1333–1360 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ekeland, I.: On the variational principle. J. Math. Anal. Appl. 47, 324–353 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  10. Eremin, I.I.: The penalty method in convex programming. Soviet. Math. Dokl. 8, 459–462 (1966)

    Google Scholar 

  11. Mordukhovich, B.S.: Penalty functions and necessary conditions for the extremum in nonsmooth and nonconvex optimization problems. Uspekhi. Math. Nauk. 36, 215–216 (1981)

    MathSciNet  MATH  Google Scholar 

  12. Mordukhovich, B.S.: Variational analysis and generalized differentiation, I: basic theory. Springer, Berlin (2006)

    Google Scholar 

  13. Mordukhovich, B.S.: Variational analysis and generalized differentiation, II: applications. Springer, Berlin (2006)

    Google Scholar 

  14. Rubinov, A.M., Yang, X.Q., Bagirov, A.M.: Penalty functions with a small penalty parameter. Optim. Methods Softw. 17, 931–964 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Uderzo, A.: Exact penalty functions and calmness for mathematical programming under nonlinear perturbations. Nonlinear Anal. 73, 1596–1609 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Yang, X.Q., Ralph, D.: Characterizations for perturbed exact penalty functions. Nonlinear Anal. 62, 101–106 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ye, J.J.: The exact penalty principle. Nonlinear Anal. 75, 1642–1654 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Zangwill, W.I.: Non-linear programming via penalty functions. Management Sci. 13, 344–358 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  19. Zaslavski, A.J.: A sufficient condition for exact penalty in constrained optimization. SIAM J. Optim. 16, 250–262 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zaslavski, A.J.: Existence of approximate exact penalty in constrained optimization. Math. Oper. Res. 32, 484–495 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zaslavski, A.J.: Optimization on Metric and Normed Spaces. Springer, New York (2010)

    Book  MATH  Google Scholar 

  22. Zaslavski, A.J.: An estimation of exact penalty in constrained optimization. J. Nonlinear Convex Anal. 11, 381–389 (2010)

    MathSciNet  MATH  Google Scholar 

  23. Zaslavski, A.J.: An estimation of exact penalty for infinite-dimensional inequality-constrained minimization problems. Set-Valued Var. Anal. 19, 385–398 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  24. Zaslavski, A.J.: An approximate exact penalty in constrained vector optimization on metric spaces. J. Optim. Theory Appl. (2013). http://dx.doi.org/10.1007/s10957-013-0288-6

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander J. Zaslavski.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zaslavski, A.J. An Approximate Exact Penalty for Vector Inequality-Constrained Minimization Problems. Vietnam J. Math. 42, 499–508 (2014). https://doi.org/10.1007/s10013-014-0077-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10013-014-0077-z

Keywords

Mathematics Subject Classification (1991)

Navigation