A new projective exact penalty function for a general constrained optimization





nonconvex constrained optimization, lower semicontinuous functions, closed constraint set, exact penalty function method, projection operation


A new projective exact penalty function method is proposed for the equivalent reduction of constrained optimization problems to unconstrained ones. In the method, the original objective function is extended to infeasible points by summing its value at the projection of an infeasible point on the feasible set with the distance to the set. The equivalence means that local and global minimums of the problems coincide. Nonconvex sets with multivalued projections are admitted, and the objective function may be lower semicontinuous. The particular case of convex problems is included. So the method does not assume the existence of the objective function outside the allowable area and does not require the selection of the penalty coefficient.


Download data is not yet available.


Eremin, I. I. (1966). The penalty method in convex programming, Soviet Math. Dokl., 8, pp. 459-462.

Eremin, I. I. (1967). The penalty method in convex programming. Cybernetics. Vol. 3 (4), pp. 53-56. https://doi.org/10.1007/BF01071708

Zangwill, W. (1967). Non-linear programming via penalty junctions, Management Science, 13, No. 5, pp. 344- 358. https://doi.org/10.1287/mnsc.13.5.344

Norkin, V. I. (2020). A stochastic smoothing method for nonsmooth global optimization. Cybernetics and Computer technologies, Iss. 1, pp. 5-14. https://doi.org/10.34229/2707-451X.20.1.1

Rockafellar, R. T., Wets, R. J. -B. (1998). Variational Analysis. Berlin, Heidelberg: Springer. (3rd printing 2009). https://doi.org/10.1007/978-3-642-02431-3

Mikhalevich, V. S., Gupal, A. M. & Norkin, V. I. (1987). Methods of Nonconvex Optimization. Moscow: Nauka (in Russian).

Di Pillo, G. (1994). Exact penalty methods. In: Algorithms for Continuous Optimization: The State of the Art, edited by E. Spedicato, pp. 1-45. Dordrecht: Kluwer Academic Publishers.

Boukari, D. & Fiacco, A. V. (1995) Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993. Optimization: A Journal of Mathematical Programming and Operations Research, 32, Iss. 4, pp. 301- 334. https://doi.org/10.1080/02331939508844053

Demyanov, V. F. (2005). Extremum Conditions and Calculus of Variations. Moscow: Vyschaya shkola (in Russian).

Dolgopolik, M. V., & Fominyh, A. V. (2019). Exact penalty functions for optimal control problems I: Main theorem and free-endpoint problems. Optimal Control Applications and Methods, 40, Iss. 6, pp. 1018-10244. https://doi.org/10.1002/oca.2530

Dolgopolik, M. V. (2020). Exact penalty functions for optimal control problems II: Exact penalization of terminal and pointwise state constraints. Optim. Control Appl. Methods, 41, pp. 898-947. https://doi.org/10.1002/oca.2577

Dolgopolik, M. V. (2022). Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates. Optimization Letters, 16, pp. 1281-1300. https://doi.org/10.1007/s11590-021-01777-2

Aubin, J-P. & Ekeland, I. (1984). Applied Nonlinear Analysis. New York: John Wiley & Sons.

Galvan, G., Sciandrone, M. & Lucidi, S. (2021). A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints. Comput. Optim. Appl., 80, pp. 33-53. https://doi.org/10.1007/s10589-021-00296-1




How to Cite

Norkin, V. . (2022). A new projective exact penalty function for a general constrained optimization. Reports of the National Academy of Sciences of Ukraine, (5), 23–29. https://doi.org/10.15407/dopovidi2022.04.023



Information Science and Cybernetics