Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints

DOI10.1023/A:1021727228957zbMath0945.90079OpenAlexW1509403658MaRDI QIDQ1293959

Ruey-Lin Sheu, Soon-Yi Wu

Publication date: 29 June 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021727228957

zbMATH Keywords

nonsmooth optimizationinterior-point methodssemi-infinite programmingpath-following methodsmin-max problemsentropic regularization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items

Unnamed Item, Solving continuous min-max problems by an iterative entropic regularization method.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smooth method for the finite minimax problem
• Interior path following primal-dual algorithms. I: Linear programming
• An interior point algorithm for semi-infinite linear programming
• A polynomial method of approximate centers for linear programming
• On the entropic regularization method for solving min-max problems with applications
• A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
• Implementation of an inexact approach to solving linear semi-infinite programming problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• Smooth Optimization Methods for Minimax Problems
• An inexact approach to solving linear semi-infinite programming problems
• A smoothing-out technique for min—max optimization
• On the generalized path-following methods for linear programming
• Numerical treatment of a class of semi‐infinite programming problems
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• State Constraints in Convex Control Problems of Bolza
• A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
• A Regularization Method for Solving the Finite Convex Min-Max Problem