Drupal-Biblio34<style face="normal" font="default" size="100%">Mean and Variance Estimation Complexity in Arbitrary Distributions via Wasserstein Minimization</style>Drupal-Biblio17<style face="normal" font="default" size="100%">MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Nonlinear conjugate gradient for smooth convex functions</style>Drupal-Biblio27<style face="normal" font="default" size="100%">A Primal-Dual Frank-Wolfe Algorithm for Linear Programming</style>Drupal-Biblio27<style face="normal" font="default" size="100%">Accelerated gradient descent: A guaranteed bound for a heuristic restart strategy</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices</style>Drupal-Biblio27<style face="normal" font="default" size="100%">Range of the displacement operator of PDHG with applications to quadratic and conic programming</style>Drupal-Biblio27<style face="normal" font="default" size="100%">Re-embedding data to strengthen recovery guarantees of clustering</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Low-rank matrix recovery with Ky Fan 2-k-norm</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Certifying clusters from sum-of-norms clustering</style>Drupal-Biblio47<style face="normal" font="default" size="100%">Provable overlapping community detection in weighted graphs</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Recovery of a mixture of Gaussians by sum-of-norms clustering</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture</style>Drupal-Biblio36<style face="normal" font="default" size="100%">A termination criterion for stochastic gradient descent for binary classification</style>Drupal-Biblio5<style face="normal" font="default" size="100%">Low-rank matrix recovery with Ky Fan 2-k-norm</style>Drupal-Biblio34<style face="normal" font="default" size="100%">Potential-based analyses of first-order methods for constrained and composite optimization</style>Drupal-Biblio17<style face="normal" font="default" size="100%">On the Complexity of Robust PCA and l1-Norm Low-Rank Matrix Approximation</style>Drupal-Biblio34<style face="normal" font="default" size="100%">Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture</style>Drupal-Biblio17<style face="normal" font="default" size="100%">IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems</style>Drupal-Biblio34<style face="normal" font="default" size="100%">A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Finding the largest low-rank clusters with Ky Fan 2-k-norm and l1-norm</style>Drupal-Biblio34<style face="normal" font="default" size="100%">A unified convergence bound for conjugate gradient and accelerated gradient</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Extreme point inequalities and geometry of the rank sparsity ball</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Convex optimization for the planted k-disjoint-clique problem</style>Drupal-Biblio34<style face="normal" font="default" size="100%">Convex relaxation for finding planted influential nodes in a social network</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Finding approximately rank-one submatrices with the nuclear norm and $\ell_1$ norm</style>Drupal-Biblio17<style face="normal" font="default" size="100%">A proximal point algorithm for sequential feature extraction applications</style>Drupal-Biblio34<style face="normal" font="default" size="100%">Some notes on applying computational divided differencing in optimization</style>Drupal-Biblio34<style face="normal" font="default" size="100%">Detecting and correcting loss of independence in nonlinear conjugate gradient</style>Drupal-Biblio47<style face="normal" font="default" size="100%">A log-barrier method for mesh quality improvement</style>Drupal-Biblio17<style face="normal" font="default" size="100%">A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Nuclear norm minimization for the planted clique and biclique problems</style>Drupal-Biblio17<style face="normal" font="default" size="100%">A robust solution procedure for hyperelastic solids with large boundary deformation</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes</style>Drupal-Biblio17<style face="normal" font="default" size="100%">On the complexity of nonnegative matrix factorization</style>Drupal-Biblio17<style face="normal" font="default" size="100%">A Condition Number Analysis of a Line-Surface Intersection Algorithm</style>Drupal-Biblio34<style face="normal" font="default" size="100%">A new secant method for unconstrained optimization</style>Drupal-Biblio47<style face="normal" font="default" size="100%">Nonnegative matrix factorization via rank-one downdating</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners</style>Drupal-Biblio34<style face="normal" font="default" size="100%">A Condition Number Analysis of a Surface-Surface Intersection Algorithm</style>Drupal-Biblio34<style face="normal" font="default" size="100%">Properties of polynomial bases used in line-surface intersection algorithm</style>Drupal-Biblio17<style face="normal" font="default" size="100%">An algorithm for two-dimensional mesh generation based on the pinwheel tiling</style>Drupal-Biblio34<style face="normal" font="default" size="100%">A conjecture that the roots of a univariate polynomial lie in a union of annuli</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Spatial convergence of crack nucleation using a cohesive finite element model on a pinwheel-based mesh</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Accurate solution of polynomial equations using Macaulay resultant matrices</style>Drupal-Biblio17<style face="normal" font="default" size="100%">An iterative method for solving complex-symmetric systems arising in electrical power modeling</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Obtaining initially rigid cohesive finite element models that are temporally convergent</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Solving polynomials with small leading coefficients</style>Drupal-Biblio34<style face="normal" font="default" size="100%">A Fully Sparse Implementation of a Primal- Dual Interior-Point Potential Reduction Method for Semidefinite Programming</style>Drupal-Biblio34<style face="normal" font="default" size="100%">A Bernstein-Bézier Sufficient Condition for Invertibility of Polynomial Mappings</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Time continuity in cohesive finite element modeling</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Accurate Solution of Weighted Least Squares by Iterative Methods</style>Drupal-Biblio17<style face="normal" font="default" size="100%">A Norm Bound for Projections with Complex Weights</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quality Mesh Generation in Higher Dimensions</style>Drupal-Biblio5<style face="normal" font="default" size="100%">Convex Optimization</style>Drupal-Biblio34<style face="normal" font="default" size="100%">A note on efficient computation of the gradient in semidefinite programming</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Geometric Separators for Finite-Element Meshes</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Numerical conformal mapping using cross-ratios and Delaunay triangulation</style>Drupal-Biblio47<style face="normal" font="default" size="100%">Preconditioning complex-symmetric layered systems arising in electrical power modeling</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Complete orthogonal decomposition for weighted least squares</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Separators for sphere-packings and nearest neighbor graphs</style>Drupal-Biblio47<style face="normal" font="default" size="100%">An aspect ratio bound for triangulating a $d$-grid cut by a hyperplane (extended abstract)</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Identifying an Optimal Basis in Linear Programming</style>Drupal-Biblio17<style face="normal" font="default" size="100%">A primal-dual interior point method whose running time depends only on the constraint matrix</style>Drupal-Biblio34<style face="normal" font="default" size="100%">QMG: Software for finite-element mesh generation</style>Drupal-Biblio5<style face="normal" font="default" size="100%">On the relationship between layered least squares and affine scaling steps</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Stable finite elements for problems with wild coefficients</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Condition Numbers for Polyhedra with Real Number Data</style>Drupal-Biblio47<style face="normal" font="default" size="100%">An accelerated interior point method whose running time depends only on $A$ (extended abstract)</style>Drupal-Biblio13<style face="normal" font="default" size="100%">Fast Wavelet Transforms for Matrices Arising from Boundary Element Methods</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Stable numerical algorithms for equilibrium systems</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Active set methods for problems in column block angular form</style>Drupal-Biblio5<style face="normal" font="default" size="100%">Automatic Mesh Partitioning</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Black-box complexity of local minimization</style>Drupal-Biblio5<style face="normal" font="default" size="100%">Complexity issues in global optimization: A survey</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Nested dissection for sparse nullspace bases</style>Drupal-Biblio5<style face="normal" font="default" size="100%">Polynomial time weak approximation algorithms for quadratic programming</style>Drupal-Biblio5<style face="normal" font="default" size="100%">On approximation algorithms for concave quadratic programming</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Approximation algorithms for indefinite quadratic programming</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Local minima for indefinite quadratic knapsack problems</style>Drupal-Biblio47<style face="normal" font="default" size="100%">Multigrid for mixed boundary integral equations</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Preconditioners for boundary integral equations</style>Drupal-Biblio47<style face="normal" font="default" size="100%">Quality mesh generation in three dimensions</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Automatic domain partitioning in three dimensions</style>Drupal-Biblio13<style face="normal" font="default" size="100%">A boundary element method for three-dimensional free surface flow</style>Drupal-Biblio47<style face="normal" font="default" size="100%">Density graphs and separators</style>Drupal-Biblio6<style face="normal" font="default" size="100%">Nonlinear Optimization: Complexity Issues</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quadratic programming with one negative eigenvalue is NP-hard</style>Drupal-Biblio17<style face="normal" font="default" size="100%">On the solution of concave knapsack problems</style>Drupal-Biblio47<style face="normal" font="default" size="100%">A unified geometric approach to graph separators</style>Drupal-Biblio13<style face="normal" font="default" size="100%">A note on wavelet bases for two-dimensional surfaces</style>Drupal-Biblio13<style face="normal" font="default" size="100%">Proving polynomial-time for sphere-constrained quadratic programming</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quadratic programming is in NP</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Exponential lower bounds for finding Brouwer fixed points</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Gaussian elimination with pivoting is P-complete</style>Drupal-Biblio47<style face="normal" font="default" size="100%">Exponential lower bounds for finding Brouwer fixed points</style>Drupal-Biblio5<style face="normal" font="default" size="100%">Analysis of polynomial approximation algorithms for constraint expressions</style>