Convergence of a subgradient method for computing the bound norm of matrices
From MaRDI portal
Publication:1057619
DOI10.1016/0024-3795(84)90093-4zbMath0563.65029OpenAlexW2028464528MaRDI QIDQ1057619
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90093-4
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (17)
A new efficient algorithm based on DC programming and DCA for clustering ⋮ Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres ⋮ Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems ⋮ Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds ⋮ On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic ⋮ Nonconvex optimization for robust tensor completion from grossly sparse observations ⋮ DC programming and DCA: thirty years of developments ⋮ The structured sensitivity of Vandermonde-like systems ⋮ On the extremal structure of least upper bound norms and their dual ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ Estimating Hadamard operator norms, with application to triangular truncation ⋮ The global convergence of the nonlinear power method for mixed-subordinate matrix norms ⋮ Estimating the Largest Elements of a Matrix ⋮ Numerical solution for optimization over the efficient set by d.c. optimization algorithms ⋮ Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max ⋮ Convergence of a subgradient method for computing the bound norm of matrices ⋮ Estimating the matrix \(p\)-norm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of a subgradient method for computing the bound norm of matrices
- Comportement périodique des fonctions à seuil binaires et applications
- A duality principle for non-convex optimisation and the calculus of variations
- Comportement itératif des fonctions à multiseuil
- Convergent Algorithms for Minimizing a Concave Function
- The convergence of symmetric threshold automata
- Global Maximization of a Convex Function with Linear Inequality Constraints
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- Maximization of A convex quadratic function under linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- Fixed Point Behavior of Threshold Functions on a Finite Set
- Concave minimization over a convex polyhedron
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- An Intersection Cut from the Dual of the Unit Hypercube
- Technical Note—A Note on Zero-One Integer and Concave Programming
- Convexity Cuts and Cut Search
- Concave Programming Applied to a Special Class of 0-1 Integer Programs
This page was built for publication: Convergence of a subgradient method for computing the bound norm of matrices
