Solving continuous min-max problems by an iterative entropic regularization method

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)

Abstract

We propose a method of outer approximations, with each approximate problem smoothed using entropic regularization, to solve continuous min-max problems. By using a well-known uniform error estimate for entropic regularization, convergence of the overall method is shown while allowing each smoothed problem to be solved inexactly. In the case of convex objective function and linear constraints, an interior-point algorithm is proposed to solve the smoothed problem inexactly. Numerical examples are presented to illustrate the behavior of the proposed method.

Original languageEnglish
Pages (from-to)597-612
Number of pages16
JournalJournal of Optimization Theory and Applications
Volume121
Issue number3
DOIs
Publication statusPublished - 2004 Jun

All Science Journal Classification (ASJC) codes

  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Solving continuous min-max problems by an iterative entropic regularization method'. Together they form a unique fingerprint.

Cite this