Coupling general penalty schemes for convex programming with the steepest descent and the proximal point algorithm

SIAM Journal on Optimization

Volumn 13, Issue 3, 2003, Pages 745-765

  Cominetti, R ^a   Courdurier, M ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Convex programming; Penalty schemes; Prox method; Subgradient inclusions

Indexed keywords

EID: 0042659396     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401397242     Document Type: Article

References (45)

1. P. ALART AND B. LEMAIRE, Penalization in nonclassical convex programming via variational convergence, Math. Programming, 51 (1991), pp. 307-331.
2. O. ALEMANY AND R. COMINETTI, Steepest descent evolution equations: Asymptotic behavior of solutions and rate of convergence, Trans. Amer. Math. Soc., 351 (1999), pp. 4847-4860.
3. F. ALVAREZ, Métodos Continuos en Optimizatión Paramétrica: El Método de Newton y Aplicaciones a la Optimización Estructural, Engineering thesis, Universidad de Chile, Santiago, Chile, 1996.
4. F. ALVAREZ, Absolute minimizer in convex programming by exponential penalty, J. Convex Anal., 7 (2000), pp. 197-202.
5. F. ALVAREZ AND R. COMINETTI, Primal and dual convergence of a proximal point exponential penalty method for linear programming, Math. Program., to appear.
6. H. ATTOUCH, Viscosity solutions of minimization problems, SIAM J. Optim., 6 (1996), pp. 769-806.
7. H. ATTOUCH AND R. COMINETTI, A dynamical approach to convex minimization coupling approximation with the steepest descent method, J. Differential Equations, 128 (1996), pp. 519-540.
8. H. ATTOUCH AND A. DAMLAMIAN, Strong solutions for parabolic variational inequalities, Nonlinear Anal., 2 (1978), pp. 329-353.
9. A. AUSLENDER, R. COMINETTI, AND M. HADDOU, Asymptotic analysis for penalty methods in convex and linear programming, Math. Oper. Res., 22 (1997), pp. 43-62.
10. A. AUSLENDER, J.P. CROUZEIX, AND P. FEDIT, Penalty-proximal methods in convex programming, J. Optim. Theory Appl., 55 (1987), pp. 1-21.
11. M.A. BAHRAOUI AND B. LEMAIRE, Convergence of diagonally stationary sequences in convex optimization, Set-Valued Anal., 2 (1994), pp. 49-61.
12. B. BAILLON AND R. COMINETTI, A convergence result for non-autonomous subgradient evolution equations and its application to the steepest descent exponential penalty trajectory in linear programming, J. Funct. Anal., 187 (2002), pp. 263-273.
13. A. BEN-TAL AND M. ZIBULEVSKY, Penalty/barrier multiplier methods for convex programming problems, SIAM J. Optim., 7 (1997), pp. 347-366.
14. D. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
15. H. BRÉZIS, Opérateurs maximaux monotones et sémigroups de contractions dans les espaces de Hilbert, Mathematical Studies 5, North-Holland, Amsterdam, 1973.
16. R.E. BRUCK, Asymptotic convergence of nonlinear contraction semigroups in Hilbert space, J. Funct. Anal., 18 (1975), pp. 15-26.
17. C.W. CARROLL, The created response surface technique for optimizing nonlinear restrained systems, Operations Res., 9 (1961), pp. 169-185.
18. T. CHAMPION, Tubularity and asymptotic convergence of penalty trajectories in convex programming, SIAM J. Optim., 13 (2002), pp. 212-227.
19. C. CHEN AND O.L. MANGASARIAN, A class of smoothing functions for nonlinear and mixed complementarity problems, Comput. Optim. Appl., 5 (1996), pp. 97-138.
20. R. COMINETTI, Coupling the proximal point algorithm with approximation methods, J. Optim. Theory Appl., 95 (1997), pp. 581-600.
21. R. COMINETTI, Asymptotic convergence of Euler's method for the exponential penalty in linear programming, J. Convex Anal., 2 (1995), pp. 145-152.
22. R. COMINETTI, Nonlinear averages and convergence of penalty trajectories in convex programming, in Proceedings of the Workshop on Ill-Posed Variational Problems and Regularization Techniques, Trier, 1998, Lecture Notes in Econom. and Math. Systems 477, Springer-Verlag, Berlin, Heidelberg, 1999, pp. 65-78.
23. R. COMINETTI AND J. SAN MARTÍN, Trajectory analysis for the exponential penalty method in linear programming, Math. Programming, 67 (1994), pp. 169-187.
24. M. COURDURIER, Análisis asintótico en penalización convexa, Memoria de Ingeniería Civil Matemática, Universidad de Chile, Santiago, Chile, 2001.
25. A. FIACCO AND G. MCCORMICK, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, 1968.
26. K.R. FRISCH, The Logarithmic Potential Method of Convex Programming, Memorandum, University Institute of Economics, Oslo, 1955.
27. H. FURUYA, K. MIYASHIBA, AND N. KENMOCHI, Asymptotic behavior of solutions to a class of nonlinear evolution equations, J. Differential Equations, 62 (1986), pp. 73-94.
28. J.B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms II, Springer-Verlag, Berlin, 1996.
29. A.N. IUSEM, B.F. SVAITER, AND J.X. DA CRUZ NETO, Central paths, generalized proximal point methods, and Cauchy trajectories in Riemannian manifolds, SIAM J. Control Optim., 37 (1999), pp. 566-588.
30. A. IUSEM AND R. MONTEIRO, On dual convergence of the generalized proximal point method with Bregman distances, Math. Oper. Res., 25 (2000), pp. 606-624.
31. A. KAPLAN, On a convex programming method with internal regularization, Soviet Math. Dokl., 19 (1978), pp. 795-799.
32. A. KAPLAN AND R. TICHATSCHKE, Proximal methods in view of interior-point strategies, J. Optim. Theory Appl., 98 (1998), pp. 399-429.
33. N. KENMOCHI, Nonlinear evolution equations with variable domains in Hilbert spaces, Proc. Japan Acad. Ser. A Math. Sci., 53 (1977), pp. 163-166.
34. B. LEMAIRE, Coupling optimization methods and variational convergence, in Trends in Mathematical Optimization, Internat. Ser. Numer. Math., Birkhäuser, Basel, Switzerland, 1988, pp. 163-179.
35. B. MARTINET, Régularisation d'inéquations variationnelles par approximations successives, Rev. Française Informat. Recherche Operationnelle, 4 (1970), pp. 154-159.
36. L. MCLINDEN, An analogue of Moreau's proximation theorem with applications to the nonlinear complementarity problem, Pacific J. Math., 88 (1980), pp. 101-161.
37. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming: Interior Point Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 131-158.
38. R. MONTEIRO AND F. ZHOU, On the existence and convergence of the central path for convex programming and some duality results, Comput. Optim. Appl., 10 (1998), pp. 51-77.
39. K. MOUALLIF, Sur la convergence d'une méthode associant pénalisation et réguralisation, Bull. Soc. Roy. Sci. Liège, 56 (1987), pp. 175-180.
40. K. MOUALLIF AND P. TOSSINGS, Une méthode de pénalisation exponentielle associée à une régularisation proximale, Bull. Soc. Roy. Sci. Liège, 56 (1987), pp. 181-190.
41. A. MOUDAFI, Coupling proximal algorithm and Tikhonov method, Nonlinear Times Digest, 1 (1994), pp. 203-210.
42. R. POLYAK, Modified barrier functions: Theory and methods, Math. Programming, 54 (1992), pp. 177-222.
43. R.T. ROCKAFELLAR, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
44. R.T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
45. R.T. ROCKAFELLAR, Ordinary convex programs without a duality gap, J. Optim. Theory Appl., 7 (1971), pp. 143-148.