Advanced search
Publication Cover
INFOR: Information Systems and Operational Research Volume 52, 2014 - Issue 3
Submit an article Journal homepage
32
Views
0
CrossRef citations to date
0
Altmetric
Articles

Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm

Abdelouahed HamdiDepartment of Mathematics, Statistics and Physics Qatar University. P.O. Box 2713, DohaQatar.Correspondence[email protected]
&
Abdellah BnouhachemSchool of Management Science and Engineering, Nanjing University, Nanjing, 210093, P.R. China and Ibn Zohr University, ENSA, BP 1136, Agadir, Morocco.Correspondence[email protected]
Pages 147-156 | Published online: 16 Jun 2016

References

  • A. Auslender and M. Haddou: An Interior Proximal Point Method for Convex Linearly Constrained Problems and Its Extension to Variationnal Inequalities. Math. Programming, 71 (1995), pp.77-100.
  • A. Auslender, M. Teboulle and S. Ben-Tiba: Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels. Submitted to M.O.R (1998).
  • J.B. Baillon and G. Haddad: Quelques Propriétés Des Opérateurs Angle-Bornés et N-Cycliquement Monotones. Int. Journal of Mathematics 26 (1977), pp. 137-150.
  • I. Csiszár: Information-type measures of difference of probability distributions and indirect observations. Studia Sci. Math. Hungar. 2(1967), pp.299-318.
  • P.P. Eggermont: Multiplicatively Iterative Algorithms for Convex Programming. Linear Algebra and Its Aplications, 130 (1990), pp.25-42.
  • O. Güler: On the Convergence of the Proximal Point Algorithm for Convex Minimization. SIAM J. on Control and Optimization, 29, 2 (1991), pp.403-419.
  • O. Güler: New Proximal Point Algorithms for Convex Minimization. SIAM J. on Optimization, 2, 4(1992), pp.649-664.
  • O. Güler: Augmented Lagrangian Algorithms for Linear Programming. Journal of optimization Theory and Applications, 75, 3 (1992), pp.445-470.
  • A. Hamdi, A Primal-Dual Proximal Point Algorithm for Constrained Convex Programs. Journal of Applied Mathematics and Computation Vol.162/1(2005), pp 293-303.
  • A. Hamdi, M.A. Noor and A.A. Mukheimer, Convergence of a Proximal Point Algorithm for Solving Minimization Problems, Journal of Applied Mathematics Volume 2012 (2012) Article ID 142862.
  • A. Hamdi and A.A. Mukheimer, Convergence of an Augmented Lagrangian Algorithm for Solving Minimization Problems. International Journal of Optimization: Theory, Methods and Applications (2011) Vol. 1 (4), pp 381-394.
  • A.N. Iusem, B. Svaiter and M. Teboulle: Entropy-Like Proximal Methods in Convex Programming. Mathematics of Operations Research, 19 (1994), pp.790-814.
  • A.N. Iusem and M. Teboulle: Convergence Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming. Mathematics of Opers. Research, 20(1995) p.657-677.
  • B. Lemaire: About the Convergence of the Proximal Point Method. Sixth French-German conference on optimization, Lecture Notes in Economics and Mathematical Sys. 382, 1992.
  • B. Martinet: Algorithmes pour la Résolution de Problèmes d’Optimisation et de Mini-Max. Thèse d’Etat, Université de Grenoble, 1972.
  • J.J. Moreau: Proximité et Dualité Dans Un Espace de Hilbert. Bulletin de la Société Mathématique de France, 93 (1965), pp.273-299.
  • Yu. E. Nesterov: On an Approach to the Construction of Optimal Methods of Minimization of Smooth Convex Functions. Translated from the Russian original in Ekonomika i Matem. Metody, Vol. 24 (1988), pp.509-517. Translated for O. Güler by V. Rachmanov, Nov. 1988.
  • Yu. E. Nesterov: Introductory Lectures On Convex Programming. CORE, Louvain-La Neuve, Belgium (1996).
  • R.T. Rockafellar: Convex Analysis. Princeton Univ. Press, 1970.
  • R.T. Rockafellar: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming, Math. Oper.Res. 1 (1976), pp.97-116.
  • M. Teboulle: Entropic Proximal Mappings with Application to Nonlinear Programming, Mathematics of Operation Research, 17, 3 (1992), pp.670-690.
  • M. Teboulle: Convergence of Proximal-like Algorithms. SIAM J On Optimization, Vol. 7 No. 4 (1997), pp.1069-1083.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.