Imputing a convex objective function

IEEE International Symposium on Intelligent Control - Proceedings

Volumn , Issue , 2011, Pages 613-619

  Keshavarz, Arezou ^a   Wang, Yang ^a   Boyd, Stephen ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OBJECTIVES; FLOW NETWORK; IN-CONTROL; OBJECTIVE FUNCTIONS; OPTIMAL CHOICE; OPTIMIZATION PROBLEMS; PARAMETRIC OPTIMIZATION; PRIOR KNOWLEDGE; UTILITY FUNCTIONS; VALUE FUNCTIONS;

COST FUNCTIONS; ELECTRIC NETWORK PARAMETERS; ESTIMATION; INTELLIGENT CONTROL;

OPTIMIZATION;

EID: 80155198863     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIC.2011.6045410     Document Type: Conference Paper

References (29)

1. Y. Wang and S. Boyd, "Fast model predictive control using online optimization," in Proceedings of the 17th IFAC world congress, 2008, pp. 6974-6997.
2. D. Burton, W. Pulleyblank, and P. Toint, "The inverse shortest path problem with upper bounds on shortest path costs," in Network Optimization, ser. Lecture notes in economics and mathematical systems, vol. 450. Springer, 1997, pp. 156-171.
3. D. Burton and P. Toint, "On an instance of the inverse shortest path problem," Mathematical Programming, vol. 53, pp. 45-61, 1992.
4. T. Nielsen and F. Jensen, "Learning a decision maker's utility function from (possibly) inconsistent behavior," Artificial Intelligence, vol. 160, pp. 53-78, 2004.
5. D. Ackerberg, C. Benkard, S. Berry, and A. Pakes, "Econometric tools for analyzing market outcomes," in Handbook of Econometrics, ser. Handbook of Econometrics, J. Heckman and E. Leamer, Eds. Elsevier, 2007, vol. 6, ch. 63.
6. P. Bajari, C. Benkard, and J. Levin, "Estimating dynamic models of imperfect competition," Econometrica, vol. 75, no. 5, pp. 1331-1370, 2007.
7. A. Ng and S. Russell, "Algorithms for inverse reinforcement learning," in In Proceedings of 17th International Conference on Machine Learning. Morgan Kauffman, 2000, pp. 663-670.
8. P. Abbeel and A. Ng, "Apprenticeship learning via inverse reinforcement learning," in In Proceedings of 21st International Conference on Machine Learning, ser. ICML '04. ACM, 2004.
9. W. Powell, Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley Series in Probability and Statistics, 2007.
10. U. Syed and R. Schapire, "A game-theoretic approach to apprenticeship learning," in Advances in Neural Information Processing Systems 20, J. Platt, D. Koller, Y. Singer, and S. Roweis, Eds. Cambridge, MA: MIT Press, 2008, pp. 1449-1456.
11. G. Neu and C. Szepesvari, "Apprenticeship learning using reinforcement learning and gradient methods," in Proceedings of the 23rd Annual Conference on Uncertainty in Artificial Intelligence (UAI-07), 2007, pp. 295-302.
12. N. Ratliff, J. Bagnell, and M. Zinkevich, "Maximum margin planning," in Proceedings of the 23rd International Conference on Machine Learning, 2006.
13. D. Ramachandran and E. Amir, "Bayesian inverse reinforcement learning," in Proceedings of the 20th International Joint Conference on Artificial Intelligence, 2007, pp. 2586-2591.
14. P. Abbeel, A. Coates, and A. Ng, "Autonomous helicopter aerobatics through apprenticeship learning," The International Journal of Robotics Research, vol. 29, 2010.
15. R. E. Kalman, "When is a linear control system optimal?" Transactions of the ASME, Journal of Basic Engineering, vol. 86, pp. 51-60, 1964.
16. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in Systems and Control Theory. Philadelphia: SIAM books, 1994.
17. D. Bertsekas, Dynamic Programming and Optimal Control: Volume 1. Athena Scientific, 2005.
18. -, Dynamic Programming and Optimal Control: Volume 2. Athena Scientific, 2007.
19. R. Bellman, Dynamic Programming. Princeton University Press, 1957.
20. D. Bertsekas and J. Tsitsiklis, Neuro-Dynamic Programming. Athena Scientific, 1996.
21. D. De Farias and B. Van Roy, "The linear programming approach to approximate dynamic programming," Operations Research, vol. 51, no. 6, pp. 850-865, 2003.
22. C. Watkins, "Learning from delayed rewards," Ph.D. dissertation, Cambridge University, Cambridge, England, 1989.
23. J. Watkins and P. Dayan, "Technical note: Q-learning," Machine Learning, vol. 8, no. 279-292, 1992.
24. V. Desai, V. Farias, and C. Moallemi, "Approximate dynamic programming via a smoothed linear program," 2010, manuscript.
25. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
26. J. M. Maciejowski, Predictive Control with Constraints. Prentice Hall, 2002.
27. W. Powell, Approximate dynamic programming: solving the curses of dimensionality. John Wiley & Sons, Inc., 2007.
28. Y. Wang and S. Boyd, "Fast evaluation of quadratic control-lyapunov policy," IEEE Transactions on control Systems Technology, vol. PP, no. 99, pp. 1-8, 2010.
29. A. Bemporad, M. Morari, V. Dua, and E. Pistikopoulos, "The explicit linear quadratic regulator for constrained systems," Automatica, vol. 38, no. 1, pp. 3-20, Jan. 2002.