Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
type: Item
instance of: scholarly article
title: Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
zbMATH Open document ID: 0945.90079
DOI: 10.1023/A:1021727228957
published in: Journal of Optimization Theory and Applications
publication date: 1999-06-29T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 1310611
zbMATH Keywords: min-max problems
zbMATH Keywords: entropic regularization
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: interior-point methods
zbMATH Keywords: path-following methods
zbMATH Keywords: semi-infinite programming
author: Ruey-Lin Sheu
author: Soon-Yi Wu
MaRDI profile type: Publication
cites work: A smooth method for the finite minimax problem
cites work: Q5187067
cites work: Q3770273
cites work: An interior point algorithm for semi-infinite linear programming
cites work: Numerical treatment of a class of semi‐infinite programming problems
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: An inexact approach to solving linear semi-infinite programming problems
cites work: Implementation of an inexact approach to solving linear semi-infinite programming problems
cites work: Q4224866
cites work: A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
cites work: A smoothing-out technique for min—max optimization
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
cites work: Q3690580
cites work: A Regularization Method for Solving the Finite Convex Min-Max Problem
cites work: On the entropic regularization method for solving min-max problems with applications
cites work: Smooth Optimization Methods for Minimax Problems
cites work: Q3215459
cites work: State Constraints in Convex Control Problems of Bolza
cites work: Q5566063
cites work: Q4296156
cites work: A polynomial method of approximate centers for linear programming
cites work: On the generalized path-following methods for linear programming
cites work: Interior path following primal-dual algorithms. I: Linear programming
full work available at URL: a:1021727228957
OpenAlex ID: W1509403658
description: scientific article; zbMATH DE number 1310611