On the entropic regularization method for solving min-max problems with applications
type: Item
instance of: scholarly article
title: On the entropic regularization method for solving min-max problems with applications
zbMATH Open document ID: 0886.90133
DOI: 10.1007/BF01199466
author: Xingsi Li
author: Shu-Cherng Fang
published in: Mathematical Methods of Operations Research
publication date: 1998-05-10T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1059729
zbMATH Keywords: entropy optimization
zbMATH Keywords: min-max problem
zbMATH Keywords: non-differentiability
zbMATH Keywords: smooth approximation
MaRDI profile type: Publication
cites work: Q3690580
cites work: An Efficient Method to Solve the Minimax Problem Directly
cites work: A smooth method for the finite minimax problem
cites work: Q3141920
cites work: Q3928936
cites work: A Regularization Method for Solving the Finite Convex Min-Max Problem
cites work: Q5540119
cites work: Information Theory and Statistical Mechanics
cites work: Q3275925
cites work: Q3260839
cites work: Surrogate methods for linear inequalities
cites work: Superlinearly convergent algorithm for min-max problems
cites work: Smooth Optimization Methods for Minimax Problems
cites work: Deriving an unconstrained convex program for linear programming
cites work: New minimax algorithm
cites work: New iterative methods for linear inequalities
cites work: A smoothing-out technique for min—max optimization
full work available at URL: https://doi.org/10.1007/bf01199466
OpenAlex ID: W2069770680
description: scientific article; zbMATH DE number 1059729