Login / Signup

A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property.

Man-Chung YueZirui ZhouAnthony Man-Cho So
Published in: Math. Program. (2019)
Keyphrases
  • error bounds
  • theoretical analysis
  • genetic algorithm
  • search algorithm
  • convex minimization
  • lower bound
  • upper bound
  • worst case
  • sufficient conditions
  • optimization algorithm
  • density estimation
  • iterative algorithms