Interior projection-like methods for monotone variational inequalities

Mathematical Programming

Volumn 104, Issue 1, 2005, Pages 39-68

  Auslender, Alfred ^a   Teboulle, Marc ^b  

^a UNIVERSITÉ LYON 1   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Conic and semidefinite programming; Convergence analysis; Convex concave saddle point problems; Duality and decomposition schemes; Extragradient method; Hyperplane projection algorithms; Interior projection like maps; Variational inequalities

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; MAPS; MATHEMATICAL PROGRAMMING; OPTIMIZATION;

CONIC AND SEMIDEFINITE PROGRAMMING; CONVERGENCE ANALYSIS; CONVEX-CONCAVE SADDLE POINT PROBLEMS; DUALITY AND DECOMPOSITION SCHEMES; EXTRAGRADIENT METHOD; HYPERPLANE PROJECTION ALGORITHMS; INTERIOR PROJECTION-LIKE MAPS; VARIATIONAL INEQUALITIES;

PROBLEM SOLVING;

EID: 24044549330     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0568-x     Document Type: Article

References (28)

1. Auslender, A.: Optimisation: Méthodes Numériques. Masson, Paris, 1976
2. Auslender, A., Teboulle, M., Ben Tiba, S.: Interior Proximal and Multiplier Methods based on Second Order Homogeneous Kernels. Mathematics of Operations Research 24, 645-668 (1999)
3. Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer Monographs in Mathematics, Springer-Verlag New-York, 2002
4. Auslender, A., Teboulle, M.: The Log-Quadratic proximal methodology in convex optimization algorithms and variational inequalities. In: P. Daniel, F. Gianessi, A. Maugeri (eds.), Equilibrium problems and variational models, Vol. 68, Nonconvex optimization and its applications, Kluwer Academic Press, 2003
5. Auslender, A., Teboulle, M.: A unified framewok for interior gradient/subgradient and proximal methods in convex optimization. Preprint, February 2003. Submitted for publication
6. Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167-175 (2003)
7. Bruck, R.D.: An iterative solution of a variational inequality for certain monotone operators in Hilbert space. Bulletin of The American Math. Soc. 81, 890-892 (1975)
8. Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3, 538-543 (1993)
9. Doljanski, M., Teboulle, M.: An interior proximal algorithm and the exponential multiplier method for semidefinite programming. SIAMJ. Optim. 9, 1-13 (1998)
10. Facchinei, F., Pang, J.S.: Finite-dimensional variational inequalities and complementarity problems. Vol. I and II. Springer Series in Operations Research. Springer-Verlag, New York, 2003
11. He, B.S., Liao, L.Z.: Improvements of some projection methods for monotone nonlinear variational inequalities. J. Optim. Theory and Appl. 112, 111-128 (2002)
12. Khobotov, E.N.: A modification of the extragradient method for the solution of variational inequalities and some optimization problems. USSR Comput. Math, and Math. Phys. 27, 120-127 (1987)
13. Konnov, I.V.: Combined relaxation methods for finding equilbrium points and solving related problems. Russian Mathematics 37, 46-53 (1993)
14. Konnov, I.V.: Combined relaxation methods for variational inequalities. Springer Verlag, Berlin, 2001
15. Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Ekonomie. i Mathematik Metody 12, 746-756 (1976).
16. [english translation: Matecon 13, 35-49 (1977)]
17. Nemirovsky, A.: Prox-method with rate of convergence O(1/k) for smooth variational inequalities and saddle point problems. Draft of 30/01/03
18. Passty, G.B.: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 72, 383-390 (1979)
19. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, NJ, 1970
20. Rockafellar, R.T.: Monotone operators and augmented Lagrangians in nonlinear programming. In: O. L. Mangasarian, et al. (eds.), "Nonlinear Programming 3", Academic Press, New York, 1978, pp. 1-25
21. Rockafellar, R.T.: Linear-Quadratic Programming and Optimal Control. SIAM J. Control and Optim. 25, 781-814 (1987)
22. Rockafellar, R.T., B Wets, R.J.: Variational Analysis. Springer Verlag, New York, 1998
23. Rockafellar, R.T., B Wets, R.J.: A Lagrangian finite generatioon technique for solving linear-quadratic problems in stochastic programming. Math. Programming Studies 28, 63-93 (1986)
24. Sibony, M.: Methodes itératives pour les equations et inequations aux dérivees partielles non linéaires de type monotone. Calcolo 7, 65-183 (1970)
25. Teboulle, M.: Convergence of Proximal-like Algorithms. SIAM J. Optim. 7, 1069-1083 (1997)
26. Tseng, P.: Alternating projection-proximal methods for convex programming and variational inequalities. SIAM J. Optim. 7, 951-965 (1997)
27. Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 38 (2), 431-446 (2000)
28. Weisstein, E.W.: Cubic Equation. From MathWorld-A Wolfram Web Resource. http://mathworId.wolfram.com/CubicEquation.html