An inexact modified subgradient algorithm for nonconvex optimization

Computational Optimization and Applications

Volumn 45, Issue 1, 2010, Pages 1-24

  Burachik, Regina S ^a,b   Kaya, C Yalçin ^b   Mammadov, Musa ^a  

^a UNIVERSITY OF BALLARAT   (Australia)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

Bang bang control; Inexact minimization; Modified subgradient method; Nonconvex optimization; Nonsmooth optimization; Sharp augmented Lagrangian

Indexed keywords

AUGMENTED LAGRANGIANS; BANG-BANG CONTROL; MODIFIED SUBGRADIENT METHOD; NONCONVEX OPTIMIZATION; NONSMOOTH OPTIMIZATION;

ALGORITHMS; BANG BANG CONTROL SYSTEMS; CONVERGENCE OF NUMERICAL METHODS; INTELLIGENT CONTROL; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

OPTIMIZATION;

EID: 77249134734     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-008-9168-7     Document Type: Article

References (25)

1. M.S. Bazaraa H.D. Sherali 1981 On the choice of step sizes in subgradient optimization Eur. J. Oper. Res. 7 380 388 0454.90056 10.1016/0377-2217(81) 90096-5 625407 (Pubitemid 12465882)
2. Birgin, E.G., Floudas, C.A., Martínez, J.M.: Global minimization using an augmented Lagrangian method with variable lower-level constraints. Preprint (2007)
3. U. Brännlund 1995 A generalized subgradient method with relaxation step Math. Program. 71 207 219 10.1007/BF01585999
4. R.S. Burachik R.N. Gasimov N.A. Ismayilova C.Y. Kaya 2006 On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian J. Glob. Optim. 34 1 55 78 1098.90091 10.1007/s10898-005-3270-5 2196850
5. R.S. Burachik C.Y. Kaya 2007 An update rule and a convergence result for a penalty function method J. Ind. Manage. Optim. 3 2 381 398 05234411 2329379
6. R.S. Burachik A.M. Rubinov 2005 On the absence of duality gap for Lagrange-type functions J. Ind. Manage. Optim. 1 1 33 38 1135.90428 2127801
7. Floudas, A.C., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gümüş, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic, Dordrecht (1999)
8. R.N. Gasimov 2002 Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming J. Glob. Optim. 24 187 203 1047.90048 10.1023/A:1020261001771 1934027 (Pubitemid 35168548)
9. Gasimov, R.N., Ismayilova, N.A.: The modified subgradient method for equality constrained nonconvex optimization problems. In: Qi, L., et al. (eds.) Optimization and Control with Applications. Applied Optimization, vol. 96, pp. 257-270. Springer, New York (2005)
10. C.Y. Kaya J.L. Noakes 2003 Computational method for time-optimal switching control J. Optim. Theory Appl. 117 1 69 92 1029.49029 10.1023/A:1023600422807 1990071
11. Kelley, C.T.: Iterative Methods for Linear and Nonlinear Equations. SIAM, Philadelphia (1995)
12. K. Kiwiel 2004 Convergence of approximate and incremental subgradient methods for convex optimization SIAM J. Optim. 14 3 807 840 1063.90039 10.1137/S1052623400376366 2085944 (Pubitemid 39073314)
13. J.C. Lagarias J.A. Reeds M.H. Wright P.E. Wright 1998 Convergence properties of the Nelder-Mead simplex method in low dimensions SIAM J. Optim. 9 1 112 147 1005.90056 10.1137/S1052623496303470 1662563
14. K.I.M. McKinnon 1998 Convergence of the Nelder-Mead simplex method to a nonstationary point SIAM J. Optim. 9 1 148 158 0962.65049 10.1137/ S1052623496303482 1662567
15. E. Mijangos 2006 Approximate subgradient methods for nonlinearly constrained network flow problems J. Optim. Theory Appl. 128 1 167 190 1130.90051 10.1007/s10957-005-7563-0 2201894 (Pubitemid 43131669)
16. Murtagh, B.A., Saunders, M.A.: MINOS 5.4 user's guide. Technical Report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University (1983)
17. A. Nedić D.P. Bertsekas 2001 Incremental subgradient methods for nondifferentiable optimization SIAM J. Optim. 12 1 109 138 0991.90099 10.1137/S1052623499362111 1870588
18. J.C. Price I.D. Coope D. Byatt 2002 A convergent variant of the Nelder-Mead algorithm J. Optim. Theory Appl. 113 1 5 19 1172.90508 10.1023/A:1014849028575 1896704 (Pubitemid 39583361)
19. B.T. Polyak 1969 Minimization of unsmooth functionals Z. Vychisl. Mat. Mat. Fiz. 9 509 521
20. Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)
21. H.D. Sherali G. Choi C.H. Tuncbilek 2000 A variable target value method for nondifferentiable optimization Oper. Res. Lett. 26 1 8 0958.90091 10.1016/S0167-6377(99)00063-2 1738988 (Pubitemid 32212479)
22. Shor, N.Z.: Minimization Methods for Nondifferentiable Functions. Springer, Berlin (1985)
23. X. Tong L. Qi Y. Yang 2006 The Lagrangian globalization method for nonsmooth constrained equations Comput. Optim. Appl. 33 89 109 1103.90077 10.1007/s10589-005-5960-9 2209469 (Pubitemid 43234654)
24. C.Y. Wang X.Q. Yang X.M. Yang 2003 Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization J. Glob. Optim 27 473 484 1061.90107 10.1023/A:1026028626328
25. Wood, A.J., Wollenberg, B.F.: Power Generation and Control. Wiley, New York (1996)