| Publication | Date of Publication | Type |
|---|
Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is \(o(\epsilon^{-2})\) rather than \(\mathcal{O}(\epsilon^{-2})\)
Computational Optimization and Applications | 2025-11-17 | Paper |
Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem
Journal of Optimization Theory and Applications | 2023-01-23 | Paper |
| Solution to a Monotone Inclusion Problem using the Relaxed Peaceman-Rachford Splitting Method: Convergence and its Rates | 2021-11-07 | Paper |
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
Computational Optimization and Applications | 2021-08-09 | Paper |
| A FISTA-Type First Order Algorithm on Composite Optimization Problems that is Adaptable to the Convex Situation | 2020-08-22 | Paper |
Policies for inventory models with product returns forecast from past demands and past sales
Annals of Operations Research | 2020-04-22 | Paper |
Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
Computational Optimization and Applications | 2019-11-22 | Paper |
Infinite horizon optimal policy for an inventory system with two types of product sharing common hardware platforms
Operations Research Letters | 2019-02-21 | Paper |
On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
Operations Research Letters | 2018-09-28 | Paper |
Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
Computational Optimization and Applications | 2018-07-20 | Paper |
Inexact subgradient methods for quasi-convex optimization problems
European Journal of Operational Research | 2016-07-06 | Paper |
A subgradient method based on gradient sampling for solving convex optimization problems
Numerical Functional Analysis and Optimization | 2016-03-18 | Paper |
Optimal policies for inventory systems with two types of product sharing common hardware platforms: single period and finite horizon
European Journal of Operational Research | 2014-07-27 | Paper |
The impact of supply chain visibility when lead time is random
OR Spectrum | 2013-02-06 | Paper |
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 Journal on Optimization | 2011-06-06 | Paper |
Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
Journal of Optimization Theory and Applications | 2011-03-10 | Paper |
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
Mathematical Programming. Series A. Series B | 2010-07-21 | Paper |
On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems
Journal of Optimization Theory and Applications | 2009-07-10 | Paper |
Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
Journal of Optimization Theory and Applications | 2008-06-04 | Paper |
A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
A note on treating a second order cone program as a special case of a semidefinite program
Mathematical Programming. Series A. Series B | 2005-04-29 | Paper |
Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems with Application to Linear Matrix Inequalities
(available as arXiv preprint) | N/A | Paper |
