A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- 1 July 1989
- journal article
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 20 (1) , 193-221
- https://doi.org/10.1007/bf01447654
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming ProblemsManagement Science, 1986
- Modelling with integer variablesPublished by Springer Nature ,1984
- Generalized Gradient Methods of Nondifferentiable Optimization Employing Space Dilatation OperationsPublished by Springer Nature ,1983
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- The simplex SON algorithm for LP/embedded network problemsPublished by Springer Nature ,1981
- A penalty linear programming method using reduced-gradient basis-exchange techniquesLinear Algebra and its Applications, 1980
- Multiplier methods: A surveyAutomatica, 1976
- A method of conjugate subgradients for minimizing nondifferentiable functionsPublished by Springer Nature ,1975
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954