Convergence of a subgradient method for computing the bound norm of matrices
- 1 November 1984
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 62, 163-182
- https://doi.org/10.1016/0024-3795(84)90093-4
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Maximization of A convex quadratic function under linear constraintsMathematical Programming, 1976
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- Variations on a cutting plane method for solving concave minimization problems with linear constraintsNaval Research Logistics Quarterly, 1974
- Concave minimization over a convex polyhedronNaval Research Logistics Quarterly, 1973
- Concave Programming Applied to a Special Class of 0-1 Integer ProgramsOperations Research, 1973
- Convexity Cuts and Cut SearchOperations Research, 1973
- An Intersection Cut from the Dual of the Unit HypercubeOperations Research, 1971
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear ConstraintsOperations Research, 1969