Journals / European Journal of Pure and Applied Mathematics (elektronik) / 2010 / Cilt: 3 - Sayı: 1

On the cross-entropic regularization method for solving min-max problems

Pages
98–106
Publication Date
2022-11-05
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

At last, the condition number is analyzed, and the results reveal that the smoothing method of multipliers is stable for any fixed smoothing parameter.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:A smoothing method of multipliers which is a natural result of cross-entropic regularization for min-max problems is analyzed.
📊
Key Findings & Data:As a smoothing technique, we first show how the smooth approximation yields the first order information on the behavior of max function.
💡
Conclusion & Impact:At last, the condition number is analyzed, and the results reveal that the smoothing method of multipliers is stable for any fixed smoothing parameter.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

A smoothing method of multipliers which is a natural result of cross-entropic regularization for min-max problems is analyzed. As a smoothing technique, we first show how the smooth approximation yields the first order information on the behavior of max function. Then under suitable assumptions, some basic properties including the Hessian are given. At last, the condition number is analyzed, and the results reveal that the smoothing method of multipliers is stable for any fixed smoothing parameter.

🔖

Cite This Article

Lİ, J., ZHANG, L., Lİ, X. (2022). On the cross-entropic regularization method for solving min-max problems. European Journal of Pure and Applied Mathematics (elektronik), Cilt: 3 - Sayı: 1, 98–106. https://ajindex.com/articles/650429

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (18)

  1. D.P.Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, Boston, MA, 1982
  2. C.Charalammbous, A.R.Conn, An efficient method to solve the Minimax problem directly, SIAM Journal on Numerical Analysis, 15: 162-187 (1978)
  3. E.Polak, D.Q.Mayne, J.E.Higgins, Superlinearly convergent algorithm for Min-max problems, Journal of Optimization Theory and Applications, 69(3): 407-439 (1991)
  4. A.Ben-Tal, A.Nemirovsky, Convex Optimization in Engineering: Modeling Analysis, Algo- rithms, Technion, Israel, 1998
  5. V.F.Demyanov, V.N.Molozemov, Introduction to Minimax, Wiley, New York, 1974
  6. D.Z.Du, P.M.Pardalos, Minimax and Applications, Kluwer Academic Publishers, Dordrecht, 1995
  7. E.Polak, Optimization: Algorithm and Consistent Approximations, Springer Verlag, New York, 1997
  8. R.Polyak, On the best convex Chebichev approximation, Soviet Mathematics Doklady, 12: 1441-1444 (1971)
  9. G.Di.Phillo, P.L.Grippo, S.Lucidi, A smooth method for the finite Minimax problem, Mathematical Programming, 60: 187-214 (1993)
  10. C.Gigola, S.Gomez, A regularization method for solving the finite convex Min-max problem, SIAM Journal on Numerical Analysis, 27: 1621-1634 (1990)
  11. R.A.Polyak, Smooth optimization methods for Minimax problems, SIAM Journal on Con- trol and Optimization, 26: 1274-1286 (1988)
  12. A.Vardi, New Minimax algorithm, Journal of Optimization Theory and Applications, 75: 613-633 (1992)
  13. I.Zang, A smoothing out technique for Min-max optimization, Mathematical Program- ming, 19: 61-77 (1980)
  14. J.B.Hiriart-Urruty, C.Lemarechal, Convex analysis and minimization algorithm, Springer- Verlag, Berlin, 1993
  15. X S Li, Entropy and Optimization, Ph.D.Thesis, University of Livepool, United Kingdom, 1987
  16. X S Li, S C Fang, On the entropic regularization method for solving Min-Max problems with applications, Mathematical Methods of Operations Research, 46: 119-130 (1997)
  17. R.T.Rockafellar, Convex Analysis, Princeton University Press, New Jersey, 1970
  18. I.Griva, R.A.Polyak, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, Mathematical Programming, 106: 237-259 (2006).