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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Liu, S., Feng, E.: The exponential penalty function method for multiobjective programming problems. Optim. Method Softw. 25, 667–675 (2010)
Correia, A., Matias, J., Mestre, P., Serôdio, C.: Classification of some penalty methods. Integral Methods Sci. Eng. 2, 131–140 (2010)
Fletcher, R.: Practical Methods of Optimization. John Wiley & Sons (2013)
Gould, N.I.M., Orban, D., Toint, Ph.L.: An interior-point \(l_1\)-penalty method for nonlinear optimization, Rutherford Appleton Laboratory technical report RAL-TR-2003-022 (2003)
Lucidi, S., Rinaldi, F.: Exact penalty functions for nonlinear integer programming problems. J. Optim. Theory Appl. 145, 479–488 (2010)
Mandal, P., Nahak, C.: The \(l_1\) exact exponential penalty function method with \((p, r)-\rho -(\eta,\theta )\)-invexity. J. Adv. Math. Stud. 5, 127–148 (2012)
Di Pillo, G., Lucidi, S., Rinaldi, F.: An approach to constrained global optimization based on exact penalty functions. J. Glob. Optim. 54, 251–260 (2012)
Jayswal, A., Choudhury, S.: An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity. J. Oper. Res. Soc. China 2, 75–91 (2014)
Ghosh, M.K., Shaiju, A.J.: Existence of value and saddle point in infinite-dimensional differential games. J. Optim. Theory Appl. 121, 301–325 (2004)
Li, T., Wang, Y.J., Liang, Z., Pardalos, P.M.: Local saddle point and a class of convexification methods for nonconvex optimization problems. J. Glob. Optim. 38, 405–419 (2007)
Antczak, T.: A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems. J. Optim. Theory Appl. 159, 437–453 (2013)
Antczak, T.: Saddle point criteria and the exact minimax penalty function method in nonconvex programming. Taiwan. J. Math. 17, 559–581 (2013)
Rockafellar, R.T.: Convex Analysis. Princeton University Press Princeton, New Jersey (1970)
Craven, B.D.: Nonsmooth multiobjective programming. Numer. Funct. Anal. Optim. 10, 49–64 (1989)
Kim, M.H.: Duality theorem and vector saddle point theorem for nonsmooth vector optimization problem. J. Appl. Math. Comput. 18, 539–551 (2005)
Philip, J.: Algorithms for the vector maximization problem. Math. Prog. 2, 207–229 (1972)
Benson, H.P.: Optimization over the efficient set. J. Math. Anal. Appl. 98, 562–580 (1984)
Yamamoto, Y.: Optimization over the efficient set: overview. J. Glob. Optim. 22, 285–317 (2002)
Acknowledgments
This research is financially supported by the DST, New Delhi, India, through Grant No. SR/FTP/MS-007/2011. The authors are greatly indebted to Professor F. Giannessi and the reviewers for their valuable comments and suggestions leading to revised version of the original draft for this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jayswal, A., Choudhury, S. An Exact Minimax Penalty Function Method and Saddle Point Criteria for Nonsmooth Convex Vector Optimization Problems. J Optim Theory Appl 169, 179–199 (2016). https://doi.org/10.1007/s10957-015-0812-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-015-0812-y