Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization

References

• Alart P., Lemaire B. Penalization in nonclassical convex programming via variational convergence. Math. Programming (1991) 51:307–331Crossref, Google Scholar
• Alvarez F. Absolute minimizer in convex programming by exponential penalty. J. Convex Anal. (2000) 7:197–202Google Scholar
• Alvarez F. Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space. SIAM J. Optim. (2004) 14:773–782Crossref, Google Scholar
• Alvarez F., Cominetti R. Primal and dual convergence of a proximal point exponential penalty method for linear programming. Math. Programming Ser. A (2002) 93(1):87–96Crossref, Google Scholar
• Attouch H. Viscosity solutions of minimization problems. SIAM J. Optim. (1996) 6:769–806Crossref, Google Scholar
• Attouch H. Variational convergence for functions and operators. (1984) (Pitman, Boston, MA) Google Scholar
• Attouch H., Cominetti R. A dynamical approach to convex minimization coupling approximation with the steepest descent method. J. Differential Equations (1996) 128:519–540Crossref, Google Scholar
• Attouch H., Cominetti R. Lp approximation of variational problems in L1 and L∞. Nonlinear Anal. (1999) 36:373–399Crossref, Google Scholar
• Auslender A. Numerical methods for nondifferentiable convex optimization. Math. Programming Stud. (1987) 30:102–127Crossref, Google Scholar
• Auslender A., Cominetti R., Haddou M. Asymptotic analysis for penalty methods in convex and linear programming. Math. Oper. Res. (1997) 22:43–62Link, Google Scholar
• Auslender A., Crouzeix J. P., Fedit P. Penalty-proximal methods in convex programming. J. Optim. Theory Appl. (1987) 55:1–21Crossref, Google Scholar
• Bahraoui M. A., Lemaire B. Convergence of diagonally stationary sequences in convex optimization. Set-Valued Anal. (1994) 2:49–61Crossref, Google Scholar
• Bakushinskii A. B., Goncharskii A. V.Iterative Methods for Ill-Posed Problems (1994) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
• Bertsekas D. P. Approximation procedures based on the method of multipliers. J. Optim. Theory Appl. (1977) 23:487–510Crossref, Google Scholar
• Bertsekas D. P.Constrained Optimization and Lagrange Multiplier Methods (1982) (Academic Press, New York) Google Scholar
• Bonnans J. F., Gilbert J., Lemaréchal C., Sagastizábal C. Numerical optimization. Theoretical and practical aspects. (2003) (Springer-Verlag, Berlin, Germany) . Translated and revised from the 1997 French original. UniversitextGoogle Scholar
• Brézis H.Opérateurs Maximaux Monotones. Mathematical Studies (1973) 5(North Holland, Amsterdam, The Netherlands) Google Scholar
• Cabot A. Proximal point algorithm controlled by a slowly vanishing term: Applications to hierarchical minimization. SIAM J. Optim. (2004/05) 15:552–572Google Scholar
• Champion T. Tubularity and asymptotic convergence of penalty trajectories in convex programming. SIAM J. Optim. (2002) 13:212–227Crossref, Google Scholar
• Cominetti R. Coupling the proximal point algorithm with approximation methods. J. Optim. Theory Appl. (1997) 95:581–600Crossref, Google Scholar
• Cominetti R. Nonlinear averages and convergence of penalty trajectories in convex programming. Ill-Posed Variational Problems and Regularization Techniques (1999) 477(Springer-Verlag, Berlin, Germany) 65–78(Trier, 1998). Lecture Notes in Economics and Mathematical SystemsCrossref, Google Scholar
• Cominetti R., Courdourier M. Coupling general penalty schemes for convex programming with the steepest descent and the proximal point algorithm. SIAM J. Optim. (2002) 13:745–765Crossref, Google Scholar
• Cominetti R., San Martín J. Trajectory analysis for the exponential penalty method in linear programming. Math. Programming (1994) 67:169–187Crossref, Google Scholar
• Correa R., Lemarechal C. Convergence of some algorithms for convex minimization. Math. Programming (1993) 62:261–275Crossref, Google Scholar
• Eckstein J., Bertsekas D. P. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Programming (1992) 55:293–318Crossref, Google Scholar
• Eckstein J., Ferris M. C. Operator-splitting methods for monotone affine variational inequalities, with a parallel application to optimal control. INFORMS J. Comput. (1998) 10:218–235Link, Google Scholar
• Fiacco A., McCormick G.Nonlinear Programming. Sequential Unconstrained Minimization Techniques (1990) (SIAM, Philadelphia, PA) . revised second edition of the 1968 original. Classics in Applied MathematicsCrossref, Google Scholar
• Facchinei F., Pang J.-S. Finite dimensional variational inequalities and complementarity problems. (2003) (Springer-Verlag, Berlin, Germany) Google Scholar
• Forsgren A., Gill P. E., Wright M. H. Interior methods for nonlinear optimization. SIAM Rev. (2002) 44:525–597Crossref, Google Scholar
• Gárciga O. R., Iusem A., Svaiter B. F. On the need for hybrid steps in hybrid proximal point methods. Oper. Res. Lett. (2001) 29:217–220Crossref, Google Scholar
• Gol’shtein E. G. A method for the modification of monotone mappings. Èkon. i Matem. Metody (Matecon) (1975) 11:1144–1159Google Scholar
• Gol’shtein E. G., Tret’yakov N. V. Modified Lagrangians in convex programming and their generalizations. Math. Programming Stud. (1979) 10:86–97Crossref, Google Scholar
• Gol’shtein E. G., Tret’yakov N. V.Modified Lagrangians and Monotone Maps in Optimization (1996) (John Wiley and Sons, New York) Google Scholar
• Gonzaga C. G. Path-following methods for linear programming. SIAM Rev. (1992) 34:167–224Crossref, Google Scholar
• Güler O. On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. (1991) 29:403–419Crossref, Google Scholar
• Hiriart-Urruty J.-B., Lemaréchal C.Convex Analysis and Minimization Algorithms. II. Advanced Theory and Bundle Methods. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] (1993) 306(Springer-Verlag, Berlin, Germany) Google Scholar
• Jarre F., Saunders M. A. A practical interior-point method for convex programming. SIAM J. Optim. (1995) 5(1):149–71Crossref, Google Scholar
• Kaplan A. On a convex programming method with internal regularization. Soviet Math. Doklady (1978) 19:795–799Google Scholar
• Kaplan A., Tichatschke R. Proximal methods in view of interior-point strategies. J. Optim. Theory Appl. (1998) 98:399–429Crossref, Google Scholar
• Konnov I. V. Combined relaxation methods for finding equilibrium points and solving related problems. Russian Math. (1993) 37:44–51(Iz. VUZ)Google Scholar
• Konnov I. V.Combined Relaxation Methods for Variational Inequalities (2001) (Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
• Lemaire B. Coupling optimization methods and variational convergence. Trends in Mathematical Optimization, International Series of Numerical Mathematics (1988) (Birkhäuser, Bassel) 163–179Crossref, Google Scholar
• Lemaire B. About the convergence of the proximal method. Advances in Optimization (1992) (Springer-Verlag, New York) 39–51Proc. Lambrecht 1991, Lecture Notes in Economics and Mathematical SystemsCrossref, Google Scholar
• Martinet B. Régularisation d’inéquations variationnelles par approximations successives. Rev. Française d’Informatique et Recherche Operationnelle (1970) 4:154–159Google Scholar
• Megiddo N. Pathways to the optimal set in linear programming. Progress in Mathematical Programming (1989) (Springer, New York) 131–158(Pacific Grove, CA, 1987)Crossref, Google Scholar
• Monteiro R., Zhou F. On the existence and convergence of the central path for convex programming and some duality results. Comput. Optim. Appl. (1998) 10:51–77Crossref, Google Scholar
• Mouallif K. Sur la convergence d’une méthode associant pénalisation et réguralisation. Bull. Soc. Royale Sci. Liège (1987) 56:175–180Google Scholar
• Mouallif K., Tossings P. Une méthode de pénalisation exponentielle associée à une régularisation proximale. Bull. Soc. Royale Sci. Liège (1987) 56:181–190Google Scholar
• Mouallif K., Tossings P. Variational metric and exponential penalization. J. Optim. Theory Appl. (1990) 67:185–192Crossref, Google Scholar
• Moudafi A. Coupling proximal algorithm and Tikhonov method. Nonlinear Times Digest (1994) 1:203–210Google Scholar
• Nesterov Y., Nemirovskii A.Interior-Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics (1994) 13(SIAM, Philadelphia, PA) Crossref, Google Scholar
• Opial Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Amer. Math. Soc. (1967) 73:591–597Crossref, Google Scholar
• Rockafellar R. T. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. (1976) 14:877–898Crossref, Google Scholar
• Rockafellar R. T. Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. (1976) 1:97–116Link, Google Scholar
• Solodov M. V., Svaiter B. F. A hybrid projection-proximal point algorithm. J. Convex Anal. (1999) 6:59–70Google Scholar
• Solodov M. V., Svaiter B. F. A unified framework for some inexact proximal point algorithms. Numer. Funct. Anal. Optim. (2001) 22:1013–1035Crossref, Google Scholar
• Sonnevend G. An analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. System Modelling and Optimization (1986) 84(Springer, Berlin, Germany) 866–875(Budapest, 1985), Lecture Notes in Control and Inform. Sci.Crossref, Google Scholar
• Tikhonov A., Arsenine V.Méthodes de Résolution de Problèmes Mal Posés (1976) (Mir, Moscow, Russia) . French translation of the 1974 Russian editionGoogle Scholar