LANGRANGE DUALITY FOR GENNERAL CONSTRAINED EXTREMUM PROBLEM
DOI:
https://doi.org/10.51453/2354-1431/2022/786Keywords:
General constrained extremum problem, Global minimum point, Sufficent optimality condition, Lagrange duality, Image setAbstract
The general constrained extremum problem is concerned in this paper for which the given cone with its interior being empty. Making use of the Lagrange duality theory with a class of regular weak separation functions in the image space, i.e., the space where the images of the objective and constraint functions run, a sufficient optimality condition for a global minimum point of that problem is presented. In addition, a state for a class of regular weak separation functions under an equivalence is also obtained. The result obtained in the literature is new and also illustrated by an example for our findings.
Downloads
References
[1] Nguyễn Xuân Tấn, Nguyễn Bá Minh (2007), Lý thuyết tối ưu không trơn, NXB Đại học Quốc gia Hà Nội, 250 trang.
[2] R.T. Rockafellar (1974), Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM J. Control, 12: 208-285.
[3] F. H. Clarke (1983), Optimization and Nonsmooth Analysis, Wiley Interscience, New York.
[4] F. Giannessi (2007), On the Theory of Lagrangian Duality. Optim. Lett., 1 (1): 9-20.
[5] A. Moldovan, L. Pellegrini (2009), On Regularity for Constrained Extremum Problems. Part 1: Sufficient Optimality Conditions. J. Optim. Theory Appl. 142: 147-163.
[6] A. Moldovan, L. Pellegrini (2009), On Regularity for Constrained Extremum Problems. Part 2: Necessary Optimality Conditions. J. Optim. Theory Appl. 142: 165-183.
[7] J.M. Borrwein, A. Lewis (1992), Partially-finite convex programming, Part 1: Quasirelative interiors and duality theorey. Math. Programming 57: 15-48.
[8] R.T. Rockafellar (1970), Convex Analysis, Princeton Mathematical Series, No. 28, Princeton University Press, Princeton. NJ.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All articles published in SJTTU are licensed under a Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA) license. This means anyone is free to copy, transform, or redistribute articles for any lawful purpose in any medium, provided they give appropriate attribution to the original author(s) and SJTTU, link to the license, indicate if changes were made, and redistribute any derivative work under the same license.
Copyright on articles is retained by the respective author(s), without restrictions. A non-exclusive license is granted to SJTTU to publish the article and identify itself as its original publisher, along with the commercial right to include the article in a hardcopy issue for sale to libraries and individuals.
Although the conditions of the CC BY-SA license don't apply to authors (as the copyright holder of your article, you have no restrictions on your rights), by submitting to SJTTU, authors recognize the rights of readers, and must grant any third party the right to use their article to the extent provided by the license.