Pages that link to "Item:Q1057619"
From MaRDI portal
The following pages link to Convergence of a subgradient method for computing the bound norm of matrices (Q1057619):
Displayed 11 items.
- Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max (Q788458) (← links)
- Estimating the matrix \(p\)-norm (Q811644) (← links)
- Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
- The structured sensitivity of Vandermonde-like systems (Q1203409) (← links)
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- Estimating Hadamard operator norms, with application to triangular truncation (Q1805217) (← links)
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614) (← links)
- A new efficient algorithm based on DC programming and DCA for clustering (Q2385500) (← links)
- On the extremal structure of least upper bound norms and their dual (Q2479508) (← links)
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms (Q2564625) (← links)