Descentwise inexact proximal algorithms for smooth optimization.

Marc Fuentes Jérôme Malick Claude Lemaréchal

Published in: Comput. Optim. Appl. (2012)

Keyphrases

optimization problems
discrete optimization
learning algorithm
computational complexity
computational cost
theoretical analysis
orders of magnitude
data structure
worst case
times faster
optimization methods
evolution strategy
database
neural network
multi objective
computationally expensive