The following pages link to Chee-Khian Sim (Q630019):
Displaying 19 items.
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
- (Q927224) (redirect page) (← links)
- Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory (Q927226) (← links)
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
- On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems (Q1029277) (← links)
- Infinite horizon optimal policy for an inventory system with two types of product sharing common hardware platforms (Q1727939) (← links)
- A note on treating a second order cone program as a special case of a semidefinite program (Q1774167) (← links)
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem (Q1785372) (← links)
- The impact of supply chain visibility when lead time is random (Q1936593) (← links)
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems (Q2044494) (← links)
- Policies for inventory models with product returns forecast from past demands and past sales (Q2173120) (← links)
- Optimal policies for inventory systems with two types of product sharing common hardware platforms: single period and finite horizon (Q2253428) (← links)
- A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function (Q2492709) (← links)
- Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
- Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem (Q2679568) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg–Kojima–Monteiro Direction (Q3004976) (← links)
