Cutting plane algorithms and state space constrained linear optimal control problems
From MaRDI portal
Publication:2550193
Cites work
- scientific article; zbMATH DE number 3156595 (Why is no real title available?)
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3165800 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3211968 (Why is no real title available?)
- scientific article; zbMATH DE number 3246195 (Why is no real title available?)
- scientific article; zbMATH DE number 3256013 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- scientific article; zbMATH DE number 3292104 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Continuous and Discrete Time Approaches to a Maximization Problem
- Cutting-Plane Methods without Nested Constraint Sets
- Discrete Approximations to Continuous Optimal Control Problems
- Generalized upper bounding techniques
- Linear Control Processes and Mathematical Programming
- Newton's method for convex programming and Tschebyscheff approximation
- On the Subdifferentiability of Convex Functions
- The Cutting-Plane Method for Solving Convex Programs
- Topics in optimization
Cited in
(3)
This page was built for publication: Cutting plane algorithms and state space constrained linear optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2550193)
