Minimizing the Condition Number of a Gram Matrix
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3973063
- On the condition number of some Gram matrices arising from least squares approximation in the complex plane
- scientific article; zbMATH DE number 1552883
- Minimizing the condition number of a positive definite matrix by completion
- Minimization of the norm, the norm of the inverse and the condition number of a matrix by completion
- scientific article; zbMATH DE number 2094777
- scientific article; zbMATH DE number 3557956
- A bound for condition numbers of matrices
- scientific article; zbMATH DE number 3909637
- scientific article; zbMATH DE number 913545
Cited in
(22)- On the condition number of some Gram matrices arising from least squares approximation in the complex plane
- Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- Quadrature rules with neighborhood of spherical designs on the two-sphere
- Least squares polynomial chaos expansion: a review of sampling strategies
- On solving simple bilevel programs with a nonconvex lower level program
- Optimizing condition numbers
- scientific article; zbMATH DE number 1552883 (Why is no real title available?)
- A recurrent neural network for solving a class of generalized convex optimization problems
- Solving semi-infinite programs by smoothing projected gradient method
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- Condition number minimization in Euclidean Jordan algebras
- K-optimal design via semidefinite programming and entropy optimization
- On exact \(K\)-optimal designs minimizing the condition number
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- A discrete Funk transform on the cubed sphere
- Convexification techniques for fractional programs
- The -condition number: applications to preconditioning and low rank generalized Jacobian updating
- Smoothing methods for nonsmooth, nonconvex minimization
- Scalable approximate optimal diagonal preconditioning
- A smoothing augmented Lagrangian method for solving simple bilevel programs
This page was built for publication: Minimizing the Condition Number of a Gram Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004977)
