×

Flattened aggregate function method for nonlinear programming with many complicated constraints. (English) Zbl 1457.90154

Summary: In this paper, efforts are made to solve nonlinear programming with many complicated constraints more efficiently. The constrained optimization problem is firstly converted to a minimax problem, where the max-value function is approximately smoothed by the so-called flattened aggregate function or its modified version. For carefully updated aggregate parameters, the smooth unconstrained optimization problem is solved by an inexact Newton method. Because the flattened aggregate function can usually reduce greatly the amount of computation for gradients and Hessians, the method is more efficient. Convergence of the proposed method is proven and some numerical results are given to show its efficiency.

MSC:

90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bagirov, AM; Al Nuaimat, A.; Sultanova, N., Hyperbolic smoothing function method for minimax problems, Optimization, 62, 759-782 (2013) · Zbl 1282.65065 · doi:10.1080/02331934.2012.675335
[2] Bandler, JW; Charalambous, C., Nonlinear programming using minimax techniques, J. Optim. Theory Appl., 13, 607-619 (1974) · Zbl 0261.90061 · doi:10.1007/BF00933620
[3] Bertsekas, DP, Approximation procedures based on the method of multipliers, J. Optim. Theory Appl., 23, 487-510 (1977) · Zbl 0346.90046 · doi:10.1007/BF00933293
[4] Bertsekas, DP, Constrained Optimization and Lagrange Multiplier Methods (1982), New York: Academic Press, New York · Zbl 0572.90067
[5] Boggs, PT; Tolle, JW, Sequential quadratic programming, Acta Numer., 4, 1-51 (1995) · Zbl 0828.65060 · doi:10.1017/S0962492900002518
[6] Dembo, RS; Steihaug, T., Truncated-newton algorithms for large-scale unconstrained optimization, Math. Program., 26, 190-212 (1983) · Zbl 0523.90078 · doi:10.1007/BF02592055
[7] Forsgren, A.; Gill, PE; Wright, MH, Interior methods for nonlinear optimization, SIAM Rev., 44, 525-597 (2003) · Zbl 1028.90060 · doi:10.1137/S0036144502414942
[8] Gigola, C.; Gomez, S., A regularization method for solving the finite convex min-max problem, SIAM J. Numer. Anal., 27, 1621-1634 (1990) · Zbl 0717.49009 · doi:10.1137/0727095
[9] Gould, N.; Orban, D.; Toint, P., Numerical methods for large-scale nonlinear optimization, Acta Numer., 14, 299-361 (2005) · Zbl 1119.65337 · doi:10.1017/S0962492904000248
[10] Han, SP; Mangasarian, OL, Exact penalty functions in nonlinear programming, Math. Program., 17, 251-269 (1979) · Zbl 0424.90057 · doi:10.1007/BF01588250
[11] Herskovits, J., A two-stage feasible directions algorithm for nonlinear constrained optimization, Math. Program., 36, 19-38 (1986) · Zbl 0623.90070 · doi:10.1007/BF02591987
[12] Jian, JB, Fast Algorithm for Smoothing Constrained Optimization: Theoretical Analysis and Numerical Experiments (2010), Beijing: Science Press, Beijing
[13] Kort, B.W., Bertsakas, D.P.: A new penalty function algorithm algorithm for constrained minimization. In: Proceedings of the 1972 IEEE Conference on Decision and Control, New Orleans (1972)
[14] Li, DH; Qi, LQ; Tam, J.; Wu, SY, A smoothing Newton method for semi-infinite programming, J. Global Optim, 30, 169-194 (2004) · Zbl 1066.90131 · doi:10.1007/s10898-004-8266-z
[15] Li, JX; Huo, JZ, Inexact smoothing method for large scale minimax optimization, Appl. Math. Comput., 218, 2750-2760 (2011) · Zbl 1244.65082
[16] Li, XS, An aggregate function method for nonlinear programming, Sci. China (A), 34, 1467-1473 (1991) · Zbl 0752.90069
[17] Li, XS; Fang, SC, On the entropic regularization method for solving min-max problems with applications, Math. Methods Oper. Res., 46, 119-130 (1997) · Zbl 0886.90133 · doi:10.1007/BF01199466
[18] Mayne, DQ; Polak, E., Feasible direction algorithm for optimization problems with equality and inequality constraints, Math. Program., 11, 67-80 (1976) · Zbl 0351.90067 · doi:10.1007/BF01580371
[19] Nocedal, J.; Wright, SJ, Numerical Optimization (2006), New York: Springer, New York · Zbl 1104.65059
[20] Pee, EY; Royset, JO, On solving large-scale finite minimax problems using exponential smoothing, J. Optim. Theory Appl., 148, 390-421 (2011) · Zbl 1216.90097 · doi:10.1007/s10957-010-9759-1
[21] Peng, JM; Lin, Z., A non-interior continuation method for generalized linear complementarity problems, Math. Program., 86, 533-563 (1999) · Zbl 0987.90081 · doi:10.1007/s101070050104
[22] Polak, E.; Royset, JO; Womersley, RS, Algorithms with adaptive smoothing for finite minimax problems, J. Optim. Theory Appl., 119, 459-484 (2003) · Zbl 1061.90117 · doi:10.1023/B:JOTA.0000006685.60019.3e
[23] Polak, E.; Womersley, RS; Yin, HX, An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems, J. Optim. Theory Appl., 138, 311-328 (2008) · Zbl 1211.90283 · doi:10.1007/s10957-008-9355-9
[24] Rustem, B., Equality and inequality constrained optimization algorithms with convergent stepsizes, J. Optim. Theory Appl., 76, 429-453 (1993) · Zbl 0797.90097 · doi:10.1007/BF00939376
[25] Tang, HW; Zhang, LW, A maximum entropy method for convex programming, Chin. Sci. Bull., 40, 361-364 (1995) · Zbl 0829.90107
[26] Wang, YC; Tang, HW, Investigation of maximum entropy method for min-max problems (I), J. Dalian Univ. Technol., 37, 495-499 (1997) · Zbl 0916.90223
[27] Wang, YC; Tang, HW, Investigation of maximum entropy method for min-max problems (II), J. Dalian Univ. Technol., 38, 1-5 (1998) · Zbl 0901.90167
[28] Xiao, Y.; Yu, B., A truncated aggregate smoothing newton method for minimax problems, Appl. Math. Comput., 216, 1868-1879 (2010) · Zbl 1194.65083
[29] Xu, S., Smoothing method for minimax problems, Comput. Optim. Appl., 20, 267-279 (2001) · Zbl 1054.90087 · doi:10.1023/A:1011211101714
[30] Yu, B.; Feng, GC; Zhang, SL, The aggregate constraint homotopy method for nonconvex nonlinear programming, Nonlinear Anal., 45, 839-847 (2001) · Zbl 1002.90092 · doi:10.1016/S0362-546X(99)00420-4
[31] Yuan, YX; Sun, WY, Optimization Theory and Methods (1999), Beijing: Science Press, Beijing
[32] Zang, I., A smoothing technique for min-max optimization, Math. Program., 19, 61-77 (1980) · Zbl 0468.90064 · doi:10.1007/BF01581628
[33] Zhang, LL; Zhang, PA; Li, XS, Some notes on the entropic method, Oper. Res. Manag. Sci., 18, 74-77 (2009)
[34] Zhao, G.; Wang, Z.; Mou, H., Uniform approximation of min/max functions by smooth splines, J. Comput. Appl. Math., 236, 699-703 (2011) · Zbl 1229.90263 · doi:10.1016/j.cam.2011.06.023
[35] Zhou, ZY, Smoothing homotopy methods for solving several mathematieal programming problems (2011), Ph.D, diss.: Dalian University of Technology, Ph.D, diss.
[36] Zhou, ZY; Yu, B., The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints, Abstr. Appl. Anal., 4, 1-14 (2014) · Zbl 1470.90136
[37] Dolan, E.; Moré, JJ, Benchmarking optimization software with performance profiles, Math. Program., 91, 201-213 (2002) · Zbl 1049.90004 · doi:10.1007/s101070100263
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.