C. Sim

activity

20162025

most citedA FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems

6 citations · 6 across the 7 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.CC2024

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity

Chee-Khian Sim

In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By so…

math.OC2024

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o (ε^{- 2})$ rather than $O (ε^{- 2})$

Serge Gratton, Chee-Khian Sim, Philippe L. Toint

We revisit the standard ``telescoping sum'' argument ubiquitous in the final steps of analyzing evaluation complexity of algorithms for smooth nonconvex optimization, and obtain a…

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(ε−2) rather than O(ε−2)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o (ε^{- 2})$ rather than $O (ε^{- 2})$