query: What is the complexity of Gradient descent given sparsity $s$, condition number $k$ and size of the matrix $N$?
positive_passages.docid: 29487
positive_passages.text: What is the time complexity of conjugate gradient method?
negative_passages.docid: 104390
negative_passages.text: How can we rewrite this optimization problem in standard form?
negative_passages.docid: 44652
negative_passages.text: Minimum and Maximum eigenvalue inequality from a positive definite matrix.
negative_passages.docid: 17815
negative_passages.text: Understanding the minimization of mean squared error function
negative_passages.docid: 35306
negative_passages.text: How to choose $\alpha$ in cost-complexity pruning?
negative_passages.docid: 12955
negative_passages.text: Classification of $n\times n$ real matrices up to congruence
negative_passages.docid: 5076
negative_passages.text: Minimize Function over Convex Subset
negative_passages.docid: 83154
negative_passages.text: Connection between Lasso formulations
negative_passages.docid: 148798
negative_passages.text: Closed form and gradient calculation for linear regression
negative_passages.docid: 88260
negative_passages.text: LASSO: Deriving the smallest lambda at which all coefficient are zero
negative_passages.docid: 18670
negative_passages.text: What is the gradient of $x^T A\, x$ with respect to the matrix $A$?
negative_passages.docid: 92763
negative_passages.text: Optimising $x_1x_2+x_2x_3+\cdots+x_nx_1$ given certain constraints
negative_passages.docid: 11566
negative_passages.text: Similar matrices and minimal polynomial
negative_passages.docid: 156877
negative_passages.text: Rank-one perturbation proof
negative_passages.docid: 74614
negative_passages.text: KKT versus unconstrained formulation of lasso regression
negative_passages.docid: 157923
negative_passages.text: RMSProp Squared Gradients
negative_passages.docid: 81049
negative_passages.text: What norm of the reconstruction error is minimized by the low-rank approximation matrix obtained with PCA?