Global convergence and finite termination of a class of smooth penalty function algorithms

References

• Al-Khayyal , F. and Kyparisis , J. 1991 . Finite convergence of algorithms for nonlinear programs and variational inequalities . J. Optim. Theory Appl. , 70 : 319 – 332 .
   Web of Science ®Google Scholar
• Auslender , A. 1999 . Penalty and barrier methods: A unified framework . SIAM J. Optim. , 10 : 211 – 230 .
   Web of Science ®Google Scholar
• Auslender , A. , Cominetti , R. and Haddou , M. 1997 . Asymptotic analysis for penalty and barrier methods in convex and linear programming . Math. Oper. Res. , 22 : 43 – 62 .
   Web of Science ®Google Scholar
• Ben-Tal , A. and Teboulle , M. 1989 . “ A Smoothing Technique for Non-differentiable Optimization Problems ” . In Lecture Notes in Mathematics , Vol. 1405 , 1 – 11 . Berlin , , West-Germany : Springer Verlag .
   Google Scholar
• Burke , J. V. and Ferris , M. C. 1993 . Weak sharp minima in mathematical programming . SIAM J. Control Optim. , 31 : 1340 – 1359 .
   Web of Science ®Google Scholar
• Calamai , P. H. and Moré , J. J. 1987 . Projected gradient methods for linearly constrained problems . Math. Program. , 39 : 93 – 116 .
   Web of Science ®Google Scholar
• Chen , C. and Mangasarian , O. L. 1995 . Smoothing method for convex inequalities and linear complementarity problems . Math. Program. , 71 : 51 – 69 .
   Web of Science ®Google Scholar
• Chen , C. and Mangasarian , O. L. 1996 . A class of smoothing functions for non-linear and mixed complementary problems . Comput. Optim. Appl. , 5 : 97 – 138 .
   Google Scholar
• Ferris , M. C. 1988 . “ Weak sharp minima and penalty functions in mathematical programming ” . England : University of Cambridge . Ph.D. thesis
   Google Scholar
• Ferris , M. C. 1991 . Finite termination of the proximal point algorithm . Math. Program. , 50 : 359 – 366 .
   Web of Science ®Google Scholar
• Fischer , A. and Kanzow , C. 1996 . On finite termination of an iterative method for linear complementarity problem . Math. Program. , 74 : 279 – 292 .
   Web of Science ®Google Scholar
• Gonzaga , C. C. and Castillo , R. A. 2003 . A nonlinear programming algorithm based on non-coercive penalty functions . Math. Program. , 96 : 87 – 101 .
   Web of Science ®Google Scholar
• Marcotte , P. and Zhu , D. 1998 . Weak sharp solutions of variational inequalities . SIAM J. Optim. , 9 : 179 – 189 .
   Web of Science ®Google Scholar
• Pinar , M. and Zenios , S. 1994 . On smoothing exact penalty functions for convex constrained optimization . SIAM J. Optim. , 4 : 486 – 511 .
   Web of Science ®Google Scholar
• Rockafellar , R. T. and Wets , R. J. 1998 . Variational Analysis , New York : Springer .
   Google Scholar
• Solodov , M. V. and Tseng , P. 2000 . Some methods based on the D-gap function for solving monotone variational inequalities . Comput. Optim. Appl. , 17 : 255 – 277 .
   Web of Science ®Google Scholar
• Wang , C. Y. , Liu , Q. and Yang , X. M. 2005 . Convergence properties of nonmonotone spectral projected gradient methods . J. Comput. Appl. Math. , 182 : 51 – 66 .
   Web of Science ®Google Scholar
• Wang , C. Y. , Zhang , J. Z. and Zhao , W. L. 2008 . Two error bounds for constrained optimization problem and their applications . Appl. Math. Optim. , 57 : 307 – 328 .
   Web of Science ®Google Scholar
• Xiu , N. H. and Zhang , J. Z. 2002 . Local convergence analysis of projection-type algorithms: A unified approach . J. Optim. Theory Appl. , 115 : 211 – 230 .
   Web of Science ®Google Scholar
• Zang , I. 1980 . A smoothing-out technique for min-max optimization . Math. Program. , 19 : 61 – 77 .
   Web of Science ®Google Scholar
• Zangwill , W. I. 1967 . Non-linear programming via penalty functions . Manag. Sci. , 13 : 344 – 358 .
   Google Scholar