Cutting plane algorithms and state space constrained linear optimal control problems
- 31 December 1970
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 4 (6), 570-605
- https://doi.org/10.1016/s0022-0000(70)80030-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Cutting-Plane Methods without Nested Constraint SetsOperations Research, 1970
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic ProgrammingSIAM Journal on Applied Mathematics, 1969
- Discrete Approximations to Continuous Optimal Control ProblemsSIAM Journal on Control, 1969
- Linear Control Processes and Mathematical ProgrammingSIAM Journal on Control, 1966
- On the subdifferentiability of convex functionsProceedings of the American Mathematical Society, 1965
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959