Proximal methods in view of interior-point strategies

Journal of Optimization Theory and Applications

Volumn 98, Issue 2, 1998, Pages 399-429

  Kaplan, A ^a   Tichatschke, R ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

Convex optimization; Ill posed problems; Interior point methods; Proximal point algorithms

Indexed keywords

EXPONENTIAL FUNCTIONS; ITERATIVE METHODS; LINEAR PROGRAMMING;

BARRIER METHOD; BARRIERS FUNCTIONS; CONVEX OPTIMISATION; CONVEX PROGRAMMING PROBLEMS; ILL POSED PROBLEM; INTERIOR POINT; INTERIOR-POINT METHOD; PROXIMAL METHODS; PROXIMAL POINT ALGORITHM; REGULARIZATION APPROACH;

CONVEX OPTIMIZATION;

EID: 0040675028     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022693618829     Document Type: Article

References (18)

1. GILL, P. E., MURRAY, W., SAUNDERS, M. A., TOMLIN, I. A., and WRIGHT, M. H., On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method, Mathematical Programming, Vol. 36, pp. 183-209, 1986.
2. 3L) Operations, Progress in Mathematical Programming, Interior Point and Related Methods, Edited by N. Megiddo, Springer Verlag, New York, New York, pp. 1-28, 1989.
3. NESTEROV, Y., and NEMIROVSKY, S., Interior-Point Polynomial Algorithms in Convex Programming, Studies in Applied Mathematics, SIAM, Philadelphia, Pennsylvania, Vol. 13, 1994.
4. DEN HERTOG, D., Interior-Point Approach to Linear, Quadratic, and Convex Programming, Kluwer Academic Publishers, Dordrecht, Holland, 1994.
5. FIACCO, A. V., and MCCORMICK, G. P., Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.
6. KAPLAN, A., Iterative Processes with Inner Regularization for Convex Programming Problems, Sibirskij Matematiceskij Zhurnal, Vol. 20, pp. 307-316, 1979 (in Russian).
7. MOUALLIF, K., and TOSSINGS, P., Une Methode de Penalisation Exponentielle Associée a une Regularisation Proximale, Bulletin de la Societe Royale Scientifique de Liège, Vol. 56, pp. 181-190, 1987.
8. KAPLAN, A., Convergence Rate Estimates for Regularized Methods Solving Variational Problems, Soviet Journal of Numerical Analysis and Mathematical Modeling, Vol. 4, pp. 99-109, 1989.
9. ALART, P., and LEMAIRE, B., Penalization in Nonclassical Convex Programming via Variational Convergence, Mathematical Programming, Vol. 51, pp. 307-331, 1991.
10. AUSLENDER, A., CROUZEIX, J. P., and FEDIT, P., Penalty-Proximal Method in Convex Programming, Journal on Optimization Theory and Applications, Vol. 55, pp. 1-21, 1987.
11. MOUDAFI, A., Coupling the Proximal Algorithm and Tikhonov Method, Nonlinear Time and Digest, Vol. 1, pp. 203-210, 1994.
12. LEHDILI, N., and MOUDAFI, A., Combining the Proximal Algorithm and Tikhonov Regularization, Optimization, Vol. 37, pp. 239-252, 1996.
13. ROCKAFELLAR, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
14. KAPLAN, A., and TICHATSCHKE, R., Stable Methods for Ill-Posed Variational Problems: Prox-Regularization of Elliptic Variational Inequalities and Semi-Infinite Problems, Akademie Verlag, Berlin, Germany, 1994.
15. POLYAK, B. T., Introduction to Optimization, Optimization Software, Publishing Division, New York, New York, 1987.
16. LUQUE, E. J., Asymptotic Convergence Analysis of the Proximal Point Algorithm, SIAM Journal on Control and Optimization, Vol. 22, pp. 277-293, 1984.
17. ROCKAFELLAR, R. T., Monotone Operators and the Proximal Point Algorithm, SIAM Journal on Control and Optimization, Vol. 15, pp. 877-898, 1976.
18. ROCKAFELLAR, R. T., Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming, Mathematics in Operations Research, Vol. 1, pp. 97-116, 1976.