6 citations · 6 across the 7 of their papers we have counts for
8 papers
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…
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…
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…
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…
Solution to a Monotone Inclusion Problem using the Relaxed Peaceman-Rachford Splitting Method: Convergence and its Rates
Chee Khian Sim
We consider the convergence behavior using the relaxed Peaceman-Rachford splitting method to solve the monotone inclusion problem , where $A, B: \Re^n \rightright…
A FISTA-Type First Order Algorithm on Composite Optimization Problems that is Adaptable to the Convex Situation
Chee-Khian Sim
In this note, we propose a FISTA-type first order algorithm, VAR-FISTA, to solve a composite optimization problem. A distinctive feature of VAR-FISTA is its ability to exploit the…