Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm

DOI10.3138/infor.52.3.147OpenAlexW2301323022MaRDI QIDQ6160427

Abdelouahed Hamdi, Abdellah Bnouhachem

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.52.3.147

zbMATH Keywords

proximal point algorithminterior proximal methodsnonquadratic regularizationsvariationnal inequalities

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of a proximal point algorithm for solving minimization problems
• Multiplicative iterative algorithms for convex programming
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• Augmented Lagrangian algorithms for linear programming
• A primal-dual proximal point algorithm for constrained convex programs
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
• 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
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convergence of Proximal-Like Algorithms
• Entropy-Like Proximal Methods in Convex Programming
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Proximité et dualité dans un espace hilbertien
• Convex Analysis

This page was built for publication: Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm