4 papers
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…
First Order Algorithm on an Optimization Problem with Improved Convergence when Problem is Convex
Chee-Khian Sim
We propose a first order algorithm, a modified version of FISTA, to solve an optimization problem with an objective function that is a sum of a possibly nonconvex function, with Li…
Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
Chee-Khian Sim
In the literature, besides the assumption of strict complementarity, superlinear convergence of implementable polynomial-time interior point algorithms using known search direction…
Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is rather than
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…