Cutting plane algorithms and state space constrained linear optimal control problems
From MaRDI portal
Publication:2550193
DOI10.1016/S0022-0000(70)80030-7zbMath0229.49026MaRDI QIDQ2550193
Kailash C. Kapur, R. M. Van Slyke
Publication date: 1970
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items (3)
A unified framework for linear control problems with state-variable inequality constraints ⋮ State-space constrained optimal control problems with control variables appearing linearly ⋮ On cutoff optimization methods in infinite-dimensional spaces and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton's method for convex programming and Tschebyscheff approximation
- Generalized upper bounding techniques
- Topics in optimization
- The Cutting-Plane Method for Solving Convex Programs
- On the Subdifferentiability of Convex Functions
- Linear Control Processes and Mathematical Programming
- Discrete Approximations to Continuous Optimal Control Problems
- Continuous and Discrete Time Approaches to a Maximization Problem
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Cutting-Plane Methods without Nested Constraint Sets
This page was built for publication: Cutting plane algorithms and state space constrained linear optimal control problems