Self-adaptive inexact proximal point methods

Computational Optimization and Applications

Volumn 39, Issue 2, 2008, Pages 161-181

  Hager, William W ^a   Zhang, Hongchao ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Degenerate optimization; Multiple minima; Proximal point; Self adaptive method

Indexed keywords

NUMERICAL METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

DEGENERATE OPTIMIZATION; MULTIPLE MINIMA; PROXIMAL POINT; SELF-ADAPTIVE METHOD;

OPTIMIZATION;

EID: 38949178770     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9067-3     Document Type: Article

References (22)

1. Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, P.L.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123-160 (1995)
2. Combettes, P.L., Pennanen, T.: Proximal methods for cohypomonotone operators. SIAM J. Control 43, 731-742 (2004)
3. Fan, J., Yuan, Y.: On the convergence of the Levenberg-Marquardt method without nonsingularity assumption. Computing 74, 23-39 (2005)
4. Ha, C.D.: A generalization of the proximal point algorithm. SIAM J. Control 28, 503-512 (1990)
5. Hager, W.W., Zhang, H.: CG_DESCENT user's guide. Tech. Rep., Department of Mathematics, University of Florida, Gainesville (2004)
6. Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170-192 (2005)
7. Hager, W.W., Zhang, H.: Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113-137 (2006)
8. Humes, C., Silva, P.: Inexact proximal point algorithms and descent methods in optimization. Optim. Eng. 6, 257-271 (2005)
9. Iusem, A.N., Pennanen, T., Svaiter, B.F.: Inexact variants of the proximal point algorithm without monotonicity. SIAM J. Optim. 13, 1080-1097 (2003)
10. Kaplan, A., Tichatschke, R.: Proximal point methods and nonconvex optimization. J. Glob. Optim. 13, 389-406 (1998)
11. Li, D., Fukushima, M., Qi, L., Yamashita, N.: Regularized Newton methods for convex minimization problems with singular solutions. Comput. Optim. Appl. 28, 131-147 (2004)
12. Luque, F.J.: Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control 22, 277-293 (1984)
13. Martinet, B.: Régularisation d'inéquations variationnelles par approximations successives. Rev. Francaise Inf. Rech. Oper. Ser. R-3 4, 154-158 (1970)
14. Martinet, B.: Determination approachée d'un point fixe d'une application pseudo-contractante. C.R. Séances Acad. Sci. 274, 163-165 (1972)
15. Pennanen, T.: Local convergence of the proximal point algorithm and multiplier methods without monotonicity. Math. Oper. Res. 27, 170-191 (2002)
16. Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 2, 97-116 (1976)
17. Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control 14, 877-898 (1976)
18. Tseng, P.: Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: Pillo, G.D., Giannessi, F. (eds.) Nonlinear Optimization and Related Topics, pp. 445-462. Kluwer, Dordrecht (2000)
19. Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226-235 (1969)
20. Wolfe, P.: Convergence conditions for ascent methods II: some corrections. SIAM Rev. 13, 185-188 (1971)
21. Yamashita, N., Fukushima, M.: The proximal point algorithm with genuine superlinear convergence for the monotone complementarity problem. SIAM J. Optim. 11, 364-379 (2000)
22. Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg-Marquardt method. In: Topics in Numerical Analysis. Comput. Suppl., vol. 15, pp. 239-249. Springer, New York (2001)