pith. sign in

Kim-Chuan Toh

Identifiers

  • name variant Kim-Chuan Toh 0.60 · backfill

Papers (39)

  1. A preconditioned augmented Lagrangian method for solving semidefinite programming problems math.OC · 2026 · author #2
  2. Gradient flow for finding E-optimal designs math.OC · 2026 · author #2
  3. A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization math.OC · 2025 · author #4
  4. ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization math.OC · 2024 · author #4
  5. Optimization Hyper-parameter Laws for Large Language Models cs.LG · 2024 · author #4
  6. A Newton-bracketing method for a simple conic optimization problem math.OC · 2019 · author #3
  7. Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures math.OC · 2019 · author #3
  8. A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems math.OC · 2019 · author #3
  9. A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization math.OC · 2018 · author #3
  10. A semi-proximal augmented Lagrangian based decomposition method for primal block angular convex composite quadratic conic programming problems math.OC · 2018 · author #3
  11. Best Nonnegative Rank-One Approximations of Tensors math.OC · 2018 · author #3
  12. Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian math.OC · 2018 · author #4
  13. Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm cs.LG · 2018 · author #2
  14. Efficient sparse semismooth Newton methods for the clustered lasso problem math.OC · 2018 · author #4
  15. BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints math.OC · 2018 · author #5
  16. On the Equivalence of Inexact Proximal ALM and ADMM for a Class of Convex Composite Programming math.OC · 2018 · author #4
  17. Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method math.OC · 2018 · author #3
  18. Computing the Best Approximation Over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone math.OC · 2018 · author #3
  19. An Efficient Semismooth Newton Based Algorithm for Convex Clustering math.OC · 2018 · author #3
  20. SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) math.OC · 2017 · author #2
  21. On the R-superlinear convergence of the KKT residues generated by the augmented Lagrangian method for convex composite conic programming math.OC · 2017 · author #3
  22. On efficiently solving the subproblems of a level-set method for fused lasso problems math.OC · 2017 · author #3
  23. A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications math.NA · 2017 · author #3
  24. On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope math.OC · 2017 · author #3
  25. On the Asymptotic Superlinear Convergence of the Augmented Lagrangian Method for Semidefinite Programming with Multiple Solutions math.OC · 2016 · author #3
  26. Max-Norm Optimization for Robust Matrix Recovery stat.ML · 2016 · author #3
  27. A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems math.OC · 2016 · author #3
  28. Fast algorithms for large scale generalized distance weighted discrimination math.OC · 2016 · author #4
  29. QSDPNAL: A two-phase augmented Lagrangian method for convex quadratic semidefinite programming math.OC · 2015 · author #3
  30. An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming math.OC · 2015 · author #2
  31. On the convergence properties of a majorized ADMM for linearly constrained convex optimization problems with coupled objective functions math.OC · 2015 · author #4
  32. A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization math.OC · 2014 · author #3
  33. A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block math.OC · 2014 · author #3
  34. A Schur Complement Based Semi-Proximal ADMM for Convex Quadratic Conic Programming and Extensions math.OC · 2014 · author #3
  35. SDPNAL$+$: A Majorized Semismooth Newton-CG Augmented Lagrangian Method for Semidefinite Programming with Nonnegative Constraints math.OC · 2014 · author #3
  36. A Convergent 3-Block Semi-Proximal Alternating Direction Method of Multipliers for Conic Programming with $4$-Type of Constraints math.OC · 2014 · author #2
  37. Spectral Operators of Matrices math.OC · 2014 · author #4
  38. Practical Matrix Completion and Corruption Recovery using Proximal Alternating Robust Subspace Minimization cs.CV · 2013 · author #4
  39. A proximal point algorithm for sequential feature extraction applications math.OC · 2011 · author #2

Mentions

  • 1108.0986 #2 · backfill · confidence 0.70 Kim-Chuan Toh
  • 2409.04777 #4 · arxiv_oai · confidence 0.70 Kim-Chuan Toh
  • 2605.17089 #2 · arxiv_oai · confidence 0.70 Kim-Chuan Toh

Frequent Coauthors