default search action
Chee-Khian Sim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Serge Gratton, Chee-Khian Sim, Philippe L. Toint:
Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(ε-2) rather than 𝒪(ε-2). CoRR abs/2408.09124 (2024) - 2023
- [j16]Chee-Khian Sim
:
Convergence Rates for the Relaxed Peaceman-Rachford Splitting Method on a Monotone Inclusion Problem. J. Optim. Theory Appl. 196(1): 298-323 (2023) - 2021
- [j15]Jiaming Liang
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems. Comput. Optim. Appl. 79(3): 649-679 (2021) - 2020
- [j14]Mabel C. Chou
Policies for inventory models with product returns forecast from past demands and past sales. Ann. Oper. Res. 288(1): 137-180 (2020)
2010 – 2019
- 2019
- [j13]Chee-Khian Sim
Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence. Comput. Optim. Appl. 74(2): 583-621 (2019) - 2018
- [j12]Renato D. C. Monteiro, Chee-Khian Sim
Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators. Comput. Optim. Appl. 70(3): 763-790 (2018) - [j11]Qi Fu
Profit Sharing Agreements in Decentralized Supply Chains: A Distributionally Robust Approach. Oper. Res. 66(2): 500-513 (2018) - 2017
- [j10]Mabel C. Chou
Infinite horizon optimal policy for an inventory system with two types of product sharing common hardware platforms. Oper. Res. Lett. 45(1): 12-18 (2017) - 2015
- [j9]Yaohua Hu, Xiaoqi Yang
Inexact subgradient methods for quasi-convex optimization problems. Eur. J. Oper. Res. 240(2): 315-327 (2015) - [j8]Chee-Khian Sim
On finding a generalized lowest rank solution to a linear semi-definite feasibility problem. Oper. Res. Lett. 43(3): 334-338 (2015) - 2013
- [j7]Mabel C. Chou
Optimal policies for inventory systems with two types of product sharing common hardware platforms: Single period and finite horizon. Eur. J. Oper. Res. 224(2): 283-292 (2013) - [j6]Ek Peng Chew, Loo Hay Lee
The impact of supply chain visibility when lead time is random. OR Spectr. 35(1): 163-190 (2013) - 2011
- [j5]Chee-Khian Sim
Asymptotic Behavior of Underlying NT Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems. J. Optim. Theory Appl. 148(1): 79-106 (2011) - [j4]Chee-Khian Sim
Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg--Kojima--Monteiro Direction. SIAM J. Optim. 21(1): 102-126 (2011)
2000 – 2009
- 2008
- [c1]Chee-Khian Sim, Hwee San Lim, Chow Jeng Wong, M. Z. MatJafri
Remote Sensing of Aerosols over Penang Island from Satellite Measurements. CGIV 2008: 380-384 - 2007
- [j3]Chee-Khian Sim
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem. Math. Program. 110(3): 475-499 (2007) - 2006
- [j2]Chee-Khian Sim
A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function. Math. Program. 107(3): 547-553 (2006) - 2005
- [j1]Chee-Khian Sim
A note on treating a second order cone program as a special case of a semidefinite program. Math. Program. 102(3): 609-613 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: