String Submodular Functions With Curvature Constraints

Consider the problem of choosing a string of actions to optimize an objective function that is string submodular. It was shown in previous papers that the greedy strategy, consisting of a string of actions that only locally maximizes the step-wise gain in the objective function, achieves at least a...

Full description

Bibliographic Details

Published in:	IEEE transactions on automatic control Vol. 61; no. 3; pp. 601 - 616
Main Authors:	Zhenliang Zhang, Chong, Edwin K. P., Pezeshki, Ali, Moran, William
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Approximation Curvature Frequency modulation Gain Mathematical analysis Optimization Strategy Strings Tasks greedy optimal control Combinatorial optimization matroid
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!