The following pages link to Kim-Chuan Toh (Q241755):
Displaying 50 items.
- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination (Q126401) (← links)
- Solving semidefinite-quadratic-linear programs using SDPT3 (Q146795) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions (Q301734) (← links)
- (Q431024) (redirect page) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- (Q495942) (redirect page) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming (Q507319) (← links)
- A note on the convergence of ADMM for linearly constrained convex optimization problems (Q513720) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
- (Q589329) (redirect page) (← links)
- Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms (Q597176) (← links)
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection (Q644904) (← links)
- Max-norm optimization for robust matrix recovery (Q681486) (← links)
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
- On the implementation of a log-barrier progressive hedging method for multistage stochastic programs (Q964982) (← links)
- An inexact primal-dual path following algorithm for convex quadratic SDP (Q995786) (← links)
- (Q1033224) (redirect page) (← links)
- Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem (Q1033225) (← links)
- Hypersingular and finite part integrals in the boundary element method (Q1291343) (← links)
- Pseudozeros of polynomials and pseudospectra of companion matrices (Q1338813) (← links)
- Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems (Q1430273) (← links)
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (Q1434073) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities (Q1819153) (← links)
- Subspace quadratic regularization method for group sparse multinomial logistic regression (Q2044487) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems (Q2146447) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192) (← links)
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming (Q2330654) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
- Spectral operators of matrices (Q2413097) (← links)
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
- An introduction to a class of matrix cone programming (Q2452376) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (Q2643618) (← links)
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
- Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming (Q2706325) (← links)
- Computing the Sobolev Regularity of Refinable Functions by the Arnoldi Method (Q2719202) (← links)
- Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method (Q2784430) (← links)
