Pages that link to "Item:Q3004977"

The following pages link to Minimizing the Condition Number of a Gram Matrix (Q3004977):

Displaying 16 items.

• A recurrent neural network for solving a class of generalized convex optimization problems (Q459437) (← links)
• Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
• Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• A smoothing augmented Lagrangian method for solving simple bilevel programs (Q742311) (← links)
• Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications (Q2137016) (← links)
• A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints (Q2182907) (← links)
• Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm (Q2279178) (← links)
• Quadrature rules with neighborhood of spherical designs on the two-sphere (Q2284795) (← links)
• Least squares polynomial chaos expansion: a review of sampling strategies (Q2310855) (← links)
• On solving simple bilevel programs with a nonconvex lower level program (Q2452381) (← links)
• Condition Number Minimization in Euclidean Jordan Algebras (Q5072593) (← links)
• <i>K</i>-Optimal Design via Semidefinite Programming and Entropy Optimization (Q5252232) (← links)
• On Exact<i>K</i>-optimal Designs Minimizing the Condition Number (Q5419353) (← links)
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
• A discrete Funk transform on the cubed sphere (Q6177269) (← links)