Minimizing the Condition Number of a Gram Matrix
From MaRDI portal
Publication:3004977
DOI10.1137/100786022zbMath1220.65055MaRDI QIDQ3004977
Robert S. Womersley, Jane J. Ye, Xiaojun Chen
Publication date: 6 June 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/5883
interpolation; condition number; spherical harmonics; least squares; smoothing algorithms; Gram matrix; smoothing method; generalized gradient; Clarke stationary point; semismooth
90C26: Nonconvex programming, global optimization
15B57: Hermitian, skew-Hermitian, and related matrices
65F35: Numerical computation of matrix norms, conditioning, scaling
15A12: Conditioning of matrices
Related Items
Condition Number Minimization in Euclidean Jordan Algebras, K-Optimal Design via Semidefinite Programming and Entropy Optimization, On ExactK-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, 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, Smoothing methods for nonsmooth, nonconvex minimization, A smoothing augmented Lagrangian method for solving simple bilevel programs, 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_1\)-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
