Convergence of a proximal point algorithm for solving minimization problems

DOI10.1155/2012/142862zbMath1250.90085OpenAlexW2105482515WikidataQ58905755 ScholiaQ58905755MaRDI QIDQ442796

Abdelouahed Hamdi, Aiman A. Mukheimer, Muhammad Aslam Noor

Publication date: 6 August 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/142862

zbMATH Keywords

proximal point algorithmconvex nonquadratic distance-like functionstechnique of Güler

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Theoretical aspect of diagonal Bregman proximal methods ⋮ Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some iterative methods for solving nonconvex bifunction equilibrium variational inequalities
• Iterative algorithms for general multivalued variational inequalities
• Finite termination of the proximal point algorithm
• Proximal minimization algorithm with \(D\)-functions
• Some developments in general variational inequalities
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• New Proximal Point Algorithms for Convex Minimization
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Proximal Minimization Methods with Generalized Bregman Functions
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Entropy-Like Proximal Methods in Convex Programming
• Proximité et dualité dans un espace hilbertien
• Convex Analysis

This page was built for publication: Convergence of a proximal point algorithm for solving minimization problems