Login / Signup

A partially inexact bundle method for convex semi-infinite minmax problems.

Antonio FuduliManlio GaudiosoGiovanni GiallombardoGiovanna Miglionico
Published in: Commun. Nonlinear Sci. Numer. Simul. (2015)
Keyphrases
  • semi infinite
  • computational complexity
  • cost function
  • dynamic programming
  • linear program
  • objective function
  • optimization problems
  • graph cuts
  • quadratic program