Abstract
Using exact penalty functions in schemes of decomposition in variables for nonlinear optimization make it possible to overcome problems related to implicit description of the feasible region of master problem. The paper deals with determining the values of penalty coefficients in such an approach. In the case where the functions of the original problem are not defined on the whole space of variables, the author proposes to use convex extension of functions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Z. Shor, Nondifferentiable Optimization and Polynomial Problems, Kluwer Acad. Publ., London (1998).
V. Zverovich, C. Fábián, E. Ellison, and G. Mitra, “A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition,” Math. Program. Comput., 4, Issue 3, 211–238 (2012).
A. Ruszczynski, “A regularized decomposition method for minimizing a sum of polyhedral functions,” Math. Program., 35, 309–333 (1986).
Yu. P. Laptin, “ε-subgradients in methods of decomposition in variables for some optimization problems,” Teoriya Optym. Rishen’, No. 2, 75–82 (2003).
Yu. P. Laptin and N. G. Zhurbenko, “Certain questions in solving block nonlinear optimization problems with coupling variables,” Cybern. Syst. Analysis, 42, No. 2, 202–208 (2006).
R. H. Byrd, G. Lopez-Calva, and J. Nocedal, “A line search exact penalty method using steering rules,” Math. Program., Series A and B, 133, 39–73 (2012).
B. N. Pshenichnyi, Convex Analysis and Extremum Problems [in Russian], Nauka, Moscow (1980).
Yu. M. Danilin, “Linearization and penalty functions,” Cybern. Syst. Analysis, 38, No. 5, 691–702 (2002).
Yu. P. Laptin and A. P. Likhovid, “Using convex extensions of functions to solve nonlinear optimization problems,” Upravl. Sist. Mash., No. 6, 25–31 (2010).
Yu. P. Laptin and T. A. Bardadym, “Some approaches to regularization of nonlinear optimization problems,” J. Autom. Inform. Sci., 43, No. 5, 40–51 (2011).
Yu. P. Laptin, “Construction of exact penalty functions,” Vestnik S.-Peterburg. Univ., Series 10: Applied Mathematics, Issue 4, 21–31 (2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
*The study was performed within the framework of the research and development project V.F.120.14 at V. M. Glushkov Institute of Cybernetics NAS of Ukraine.
Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2016, pp. 93–104.
Rights and permissions
About this article
Cite this article
Laptin, Y.P. Exact Penalty Functions and Convex Extensions of Functions in Schemes of Decomposition in Variables* . Cybern Syst Anal 52, 85–95 (2016). https://doi.org/10.1007/s10559-016-9803-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-016-9803-8