Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm

DOI10.3138/INFOR.52.3.147MaRDI QIDQ6160427zbMATH OpenOpenAlexFDO

Authors 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

interior proximal methodsnonquadratic regularizationsproximal point algorithmvariationnal inequalities

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Entropy-Like Proximal Methods in Convex Programming
• Entropy function-based algorithms for solving a class of nonconvex minimization problems
• On the entropic regularization method for solving min-max problems with applications
• Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
• On the convergence rate of entropic proximal optimization methods
• An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Entropic proximal decomposition methods for convex programs and variational inequalities
• Solving continuous min-max problems by an iterative entropic regularization method.
• An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming

Cites work

• 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
• Augmented Lagrangian algorithms for linear programming
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convergence of a proximal point algorithm for solving minimization problems
• Convergence of Proximal-Like Algorithms
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Convex Analysis
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Entropy-Like Proximal Methods in Convex Programming
• scientific article; zbMATH DE number 4079168 (Why is no real title available?)
• scientific article; zbMATH DE number 3252891 (Why is no real title available?)
• Multiplicative iterative algorithms for convex programming
• New Proximal Point Algorithms for Convex Minimization
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Proximité et dualité dans un espace hilbertien
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones

Cited in

(2)

• Minimization Problems Based on Relative <inline-formula> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula>-Entropy I: Forward Projection
• An entropy regularization technique for minimizing a sum of Tchebycheff norms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160427)