×

Existence of exact penalty for constrained optimization problems in Hilbert spaces. (English) Zbl 1112.49032

Summary: In this paper we use the penalty approach in order to study two constrained minimization problems in Hilbert spaces. A penalty function is said to have the exact penalty property if there is a penalty coefficient for which a solution of an unconstrained penalized problem is a solution of the corresponding constrained problem. In this paper we establish a sufficient condition for the exact penalty property.

MSC:

49M30 Other numerical methods in calculus of variations (MSC2010)
90C26 Nonconvex programming, global optimization
90C30 Nonlinear programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Boukari, D.; Fiacco, A. V., Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993, Optimization, 32, 301-334 (1995) · Zbl 0820.90097
[2] Burke, J. V., An exact penalization viewpoint of constrained optimization, SIAM J. Control Optim., 29, 968-998 (1991) · Zbl 0737.90060
[3] Cesari, L., Optimization — Theory and Applications (1983), Springer-Verlag: Springer-Verlag New York
[4] Clarke, F. H., Optimization and Nonsmooth Analysis (1983), Willey Interscience · Zbl 0727.90045
[5] Demyanov, V. F., Constrained problems of calculus of variations via penalization technique, (Equilibrium Problems and Variational Models (Erice, 2000). Equilibrium Problems and Variational Models (Erice, 2000), Nonconvex Optim. Appl., vol. 68 (2003), Kluwer Acad. Publ.: Kluwer Acad. Publ. Norwel, MA), 79-108 · Zbl 1069.49024
[6] Demyanov, V. F., Exact penalty functions and problems of the calculus of variations, Avtomat. i Telemekh., 136-147 (2004)
[7] Deville, R.; Godefroy, R.; Zizler, V., Smoothness and Renorming in Banach Spaces (1993), Longman · Zbl 0792.46007
[8] Di Pillo, G.; Grippo, L., Exact penalty functions in constrained optimization, SIAM J. Control Optim., 27, 1333-1360 (1989) · Zbl 0681.49035
[9] Eremin, I. I., The penalty method in convex programming, Sov. Math. Dokl., 8, 459-462 (1966) · Zbl 0155.28405
[10] Hiriart-Urruty, J.-B.; Lemarechal, C., Convex Analysis and Minimization Algorithms (1993), Springer: Springer Berlin · Zbl 0795.49001
[11] Luo, Z. Q.; Pang, J.-S.; Ralph, D., Mathematical Programs with Equilibrium Constraints (1996), Cambridge University Press
[12] Mangasarian, O. L.; Pang, J.-S., Exact penalty functions for mathematical programs with linear complementary constraints, Optimization, 42, 1-8 (1997) · Zbl 0888.90134
[13] Mordukhovich, B. S., Penalty functions and necessary conditions for the extremum in nonsmooth and nonconvex optimization problems, Uspekhi Mat. Nauk, 36, 215-216 (1981) · Zbl 0478.49015
[14] Palais, R., Lusternik-Schnirelman theory of Banach manifolds, Topology, 5, 115-132 (1966) · Zbl 0143.35203
[15] Rockafellar, R. T., (Penalty Methods and Augmented Lagrangians, in: Nonlinear Programming Fifth Conference on Optimization Techniques (Rome, 1973), Part I. Penalty Methods and Augmented Lagrangians, in: Nonlinear Programming Fifth Conference on Optimization Techniques (Rome, 1973), Part I, Lecture Notes in Comput. Sci., vol. 3 (1973), Springer: Springer Berlin), 418-425
[16] Rubinov, A. M.; Glover, B. M.; Yang, X. Q., Decreasing functions with applications to penalization, SIAM J. Optim., 10, 289-313 (1999) · Zbl 0955.90127
[17] Rubinov, A. M.; Yang, X. Q.; Bagirov, A. M., Penalty functions with a small penalty parameter, Optim. Methods Softw., 17, 931-964 (2002) · Zbl 1065.90069
[18] Zangwill, W. I., Nonlinear programming via penalty functions, Management Sci., 13, 344-358 (1967) · Zbl 0171.18202
[19] Zaslavski, A. J., A sufficient condition for exact penalty in constrained optimization, SIAM J. Optim., 16, 250-262 (2005) · Zbl 1098.49030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.