An update rule and a convergence result for a penalty function method

Journal of Industrial and Management Optimization

Volumn 3, Issue 2, 2007, Pages 381-398

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

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

^b UNIVERSITY OF BALLARAT   (Australia)

Author keywords

Duality; Least exact penalty parameter; Nonconvex optimization; Nonsmooth optimization; Penalty function method; Penalty parameter update

Indexed keywords

EID: 57249108749     PISSN: 15475816     EISSN: 1553166X     Source Type: Journal    
DOI: 10.3934/jimo.2007.3.381     Document Type: Article

References (19)

1. M. S. Bazaraa, and H. D. Sherali, On the choice of step sizes in subgradient optimization, European Journal of Operations Research, 7 (1981), 380-388.
2. D. Boukari, and A. V. Fiacco, Survey of penalty, exact penalty and multiplier method from 1968 to 1993, Optimization, 32 (1995), 301-334.
3. R. S. Burachik, R. N. Gasimov, N. A. Ismayilova, and C. Y. Kaya, On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian, Journal of Global Optimization, 34 (2006), 55-78.
4. J. V. Burke, An exact penalization viewpoint of constrained optimization, SIAM Journal on Control and Optimization, 29 (1991), 968-998.
5. J. M. Danskin, The theory of max-min with applications, SIAM Journal on Applied Mathematics, 14 (1966), 641-664.
6. G. di Pillo, Exact Penalty Methods, in "Algorithms for Continuous Optimization" (Ed. E. Spedicato), Kluwer Academic Publishers, the Netherlands, (1994), 209-253.
7. A. C. Floudas, P. M. Pardalos, C. S. Adjiman, W. R. Esposito, Z. H. Gümüş S. T. Harding, J. L. Klepeis, C. A. Meyer, and C. A. Schweiger, "Handbook of Test Problems in Local and Global Optimization," Kluwer Academic Publishers, the Netherlands, 1999.
8. R. N. Gasimov, Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming, Journal of Global Optimization, 24 (2002), 187-203.
9. R. N. Gasimov, and N. A. Ismayilova, The modified subgradient method for equality constrained nonconvex optimization problems, Qi, Liqun (ed.) et al., Optimization and Control with Applications, New York, Springer. Applied Optimization, 96 (2005), 257-270.
10. I. Griva, and R. A. Polyak, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, Mathematical Programming, Ser. A, 106 (2006), 237-259.
11. W. Hock, and K. Schittkowski, "Test Examples for Nonlinear Programming Codes," Springer-Verlag, Germany, 1981.
12. R. A. Polyak, Nonlinear rescaling vs. smoothing technique in convex optimization, Mathematical Programming, Ser. A, 92 (2002), 197-235.
13. R. A. Polyak, and M. Teboulle, Nonlinear rescaling and proximal-like methods in convex optimization, Mathematical Programming, 76 (1997), 265-284.
14. R. T. Rockafellar, "Convex Analysis," Princeton University Press, 1970.
15. R. T. Rockafellar, and R. J.-B. Wets, "Variational Analysis," Springer, Berlin, 1998.
16. A. M. Rubinov, and X. Q. Yang, "Lagrange-type Functions in Constrained Non-convex Optimization," Kluwer Academic Publishers, Dordrecht, 2003.
17. A. M. Rubinov, X. Q. Yang, and A. M. Bagirov, Penalty functions with a small penalty parameter: numerical experiments, Optimization Methods and Software, 17 (2003), 931-964.
18. A. M. Rubinov, X. Q. Yang, A. M. Bagirov, and R. N. Gasimov, Lagrange-type functions in constrained optimization, Journal of Mathematical Sciences, 115 (2003), 2437-2505.
19. H. D. Sherali, G. Choi, and C. H. Tuncbilek, A variable target value method for nondifferentiable optimization, Operations Research Letters, 26 (2000), 1-8.