Abstract
In the last few years, the applicability of the penalty function method, initiated by Zangwill [1] for the constrained optimization problem, has grown significantly. The penalty function approach transforms the constrained optimization problem into an unconstrained optimization problem and preserves the optimality of the original one. In this way, the solution sets of the unconstrained optimization problems ideally converge to the solution sets of the constrained optimization problems. The idea behind the penalty function approach (the convergence of the solution sets for constrained optimization problem and its associated unconstrained optimization problem) encourages the researchers to establish the equivalence between the solution set of constrained and unconstrained problems under suitable assumptions for different kinds of optimization problems. Antczak [2] used an exact \(l_{1}\) penalty function method in convex nondifferentiable multi-objective optimization problem and established the equivalence between the solution set of the original problem and its associated penalized problem. Also, Alvarez [3], Antczak [4] and Liu and Feng [5] explored the exponential penalty function method for multi-objective optimization problem and established the relationships between the constrained and unconstrained optimization problems. On the other hand, Li et al. [6] used the penalty function method to solve the continuous inequality constrained optimal control problem. Thereafter, Jayswal and Preeti [7] extended the applicability of the penalty function method for the multi-dimensional optimization problem. Moreover, Jayswal et al. [8] explored the same for uncertain optimization problem under convexity assumptions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
W.I. Zangwill, Nonlinear programming via penalty functions. Manag. Sci. 13, 344–358 (1967)
T. Antczak, The vector exact \(l_{1}\) penalty method for nondifferentiable convex multi-objective programming problems. Appl. Math. Comput. 218, 9095–9106 (2012)
F. Alvarez, Absolute minimizer in convex programming by exponential penalty. J. Convex Anal. 7, 197–202 (2000)
T. Antczak, Vector exponential penalty function method for nondifferentiable multi-objective programming problems. Bull. Malays. Math. Sci. Soc. 41, 657–686 (2016)
S. Liu, E. Feng, The exponential penalty function method for multi-objective programming problems. Optim. Meth. Softw. 25, 667–675 (2010)
B. Li, C.J. Yu, K.L. Teo, G.R. Duan, An exact penalty function method for continuous inequality constrained optimal control problem. J. Optim. Theory Appl. 151, 260–291 (2011)
A.J. Preeti, An exact \(l_{1}\) penalty function method for multi-dimensional first-order PDE constrained control optimisation problem. Eur. J. Control 52, 34–41 (2020)
A.J. Preeti, M. Arana-Jiménez, An exact \(l_{1}\) penalty function method for a multi-dimensional optimization problem with data uncertainty. Optim. Control Appl. Meth. 41, 1705–1717 (2020)
Şt. Mititelu, Optimality and duality for invex multi-dimensional control problems with mixed constraints. J. Adv. Math. Stud. 2, 25–34 (2009)
S. Treanţă, Higher-order Hamilton dynamics and Hamilton-Jacobi divergence PDE. Comput. Math. Appl. 75, 547–560 (2018)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Jayswal, A., Preeti, Treanţă, S. (2022). Multi-dimensional Variational Control Problem with Data Uncertainty in Constraint Functionals. In: Multi-dimensional Control Problems. Industrial and Applied Mathematics. Springer, Singapore. https://doi.org/10.1007/978-981-19-6561-6_3
Download citation
DOI: https://doi.org/10.1007/978-981-19-6561-6_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-6560-9
Online ISBN: 978-981-19-6561-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)