An algorithm for convex constrained minimax optimization based on duality

Guy Cohen

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We consider the problem of finding the minimum value of the upper hull of n convex functionals on a Hilbert space, subject to convex constraints. The problem is reformulated as that of finding the minimum of the "worst" convex combination of these functionals, which eventually yields a saddle-point problem. We propose a new algorithm to solve this problem that simplifies the task of updating the dual variables. Simultaneously, the constraints can be dualized by introducing other dual multipliers. Convergence proofs are given and a concrete example shows the practical and computational advantages of the proposed algorithm and approach.

Original languageEnglish
Pages (from-to)347-372
Number of pages26
JournalApplied Mathematics and Optimization
Issue number1
StatePublished - 1 Mar 1981
Externally publishedYes

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'An algorithm for convex constrained minimax optimization based on duality'. Together they form a unique fingerprint.

Cite this