Conditional subgradient optimization — Theory and applications
Authors:
- Torbjörn LarssonTLTorbjörn Larsson
- Michael PatrikssonMPMichael Patriksson
- Ann-Brith StrömbergASAnn-Brith Strömberg
- 1 January 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 88 (2) , 382-403
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraintsOptimization, 1989
- Improving feasible directions for a class of nondifferentiable functionsEuropean Journal of Operational Research, 1988
- A reduced subgradient algorithm1987
- Advanced start for the multicommodity network flow problem1986
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- The Design of the XMP Linear Programming LibraryACM Transactions on Mathematical Software, 1981
- Subdifferentials of functions on setsCybernetics and Systems Analysis, 1980
- Method of the generalized gradient for finding the absolute minimum of a convex functionCybernetics and Systems Analysis, 1977
- On improving relaxation methods by modified gradient techniques1975
- Lagrangean relaxation for integer programming1974