Inexactly constrained discrete adjoint approach for steepest descent-based optimization algorithms.
David A. BrownSiva NadarajahPublished in: Numer. Algorithms (2018)
Keyphrases
- optimization problems
- discrete optimization
- times faster
- combinatorial optimization
- continuous optimization
- theoretical analysis
- significant improvement
- benchmark datasets
- computationally expensive
- approximately optimal
- learning algorithm
- social networks
- computational cost
- optimization methods
- global convergence
- complex optimization problems