Login / Signup

A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem.

Alberto FerrerMiguel A. GobernaE. González-GutiérrezMaxim I. Todorov
Published in: Ann. Oper. Res. (2017)
Keyphrases
  • semi infinite
  • computational complexity
  • semidefinite
  • learning algorithm
  • objective function
  • lower bound
  • optimization problems
  • linear program
  • optimality conditions