Abstract
In this part of the two-part series of papers, algorithms for solving some variable programming (VP) problems proposed in Part I are investigated. It is demonstrated that the non-differentiability and the discontinuity of the maximum objective function, as well as the summation objective function in the VP problems constitute difficulty in finding their solutions. Based on the principle of statistical mechanics, we derive smooth functions to approximate these non-smooth objective functions with specific activated feasible sets. By transforming the minimax problem and the corresponding variable programming problems into their smooth versions we can solve the resulting problems by some efficient algorithms for smooth functions. Relevant theoretical underpinnings about the smoothing techniques are established. The algorithms, in which the minimization of the smooth functions is carried out by the standard quasi-Newton method with BFGS formula, are tested on some standard minimax and variable programming problems. The numerical results show that the smoothing techniques yield accurate optimal solutions and that the algorithms proposed are feasible and efficient.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Ben-Tal and M. Teboulle, “A smoothing technique for nondifferentiable optimization problems,” in Optimization–-Fifth French-German Conference, Castel Novel 1988, Lecture Notes in Mathematics 1405, S. Dolecki (Ed.), Spring-Verlag: Berlin, 1989, pp. 1–11.
R. Bowley and M. Sánchez, Introductory Statistical Mechanics. Oxford University Press: New York, 1996.
C. Carrod, Statistical Mechanics and Thermodynamics. Oxford University Press: New York, 1995.
G. Di Pillo and L. Grippo, “A smooth method for the finite minimax problem,” Mathematical Programming, vol. 60, pp. 187–214, 1993.
C. Gigola and S. Gomez, “A regularization method for solving the finite convex min-max problems,” SIAM Journal on Numerical Analysis, vol. 27, no. 6, pp. 1621–1634, 1990.
Y.-C. Jiao, Y. Leung, Z. Xu, and J.-S. Zhang, “Variable programming: A generalized minimax problem: Part I. Models and theory,” Computational Optimization and Applications, vol. 30, no. 3, pp. 229–261, 2005.
S. Kirkpatrick, C.D. Gelatt, Jr., and M.P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–679, 1983.
X.-S. Li, “An efficient approach to nonlinear minimax problems,” Chinese Science Bulletin, vol. 37, no. 10, pp. 802–805, 1992.
X.-S. Li, “A smoothing technique for non-smooth optimization problems,” in Optimization, K.H. Phua, C.M. Wang, W.Y. Yeong et al. (Eds.), World Scientific Publishing: River Edge, NJ, vol. 1, 1992, pp. 90–97.
X.-S. Li, “An efficient approach to a class of nonsmooth optimization problems,” Science in China Series A, vol. 37, no. 3, pp. 323–330, 1994.
X.-S. Li and S.-C. Fang, “On the entropic regularization method for solving min-max problems with applications,” Mathematical Methods of Operations Research, vol. 46, no. 1, pp. 119–130, 1997.
J.D. Nulton and P. Salamon, “Statistical mechanics of combinatorial optimization,” Physical Review A: General Physics, vol. 37, no. 4, pp. 1351–1356, 1988.
R. Palmer, “Statistical mechanics approaches to complex optimization problems,” in The Economy as an Evolving Complex System, P.W. Anderson, K.J. Arrow, and D. Pines (Eds.), SFI Studies in the Sciences of Complexity, Proc. vol. 5, Addison-Wesley: Redwood City, pp. 177–193, 1988.
R.A. Polyak, “Smooth optimization methods for minimax problems,” SIAM Journal on Control and Optimization, vol. 26, no. 6, pp. 1274–1286, 1988.
T.M. Reed and K.E. Gubbins, Applied Statistical Mechanics: Thermodynamic and Transport Properties of Fluids, Butterworth-Heinemann: Boston, 1973.
J. Richardt, F. Karl, and C. Müller, “Connections between fuzzy theory, simulated annealing, and convex duality,” Fuzzy Sets and Systems, vol. 96, pp. 307–334, 1998.
S. Xu, “Smoothing method for minimax problems,” Computational Optimization and Applications, vol. 20, no. 3, pp. 267–279, 2001.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the RGC grant CUHK 152/96H of the Hong Kong Research Grant Council.
Rights and permissions
About this article
Cite this article
Jiao, YC., Leung, Y., Xu, Z. et al. Variable Programming: A Generalized Minimax Problem. Part II: Algorithms. Comput Optim Applic 30, 263–295 (2005). https://doi.org/10.1007/s10589-005-4617-z
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10589-005-4617-z