Cutting plane algorithms and state space constrained linear optimal control problems

DOI10.1016/S0022-0000(70)80030-7zbMATH Open0229.49026MaRDI QIDQ2550193FDOQ2550193

Authors: Kailash C. Kapur, Richard Van Slyke 

Publication date: 1970

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Linear optimal control problems (49N05)

Cites Work

• Title not available (Why is that?)
• On the Subdifferentiability of Convex Functions
• Title not available (Why is that?)
• The Cutting-Plane Method for Solving Convex Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Newton's method for convex programming and Tschebyscheff approximation
• Title not available (Why is that?)
• Generalized upper bounding techniques
• Title not available (Why is that?)
• Topics in optimization
• Cutting-Plane Methods without Nested Constraint Sets
• Discrete Approximations to Continuous Optimal Control Problems
• Title not available (Why is that?)
• Linear Control Processes and Mathematical Programming
• Continuous and Discrete Time Approaches to a Maximization Problem

Cited In (3)

• State-space constrained optimal control problems with control variables appearing linearly
• A unified framework for linear control problems with state-variable inequality constraints
• On cutoff optimization methods in infinite-dimensional spaces and applications

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)