References
- Alon, N., & Naor, A. (2006). Approximating the cut-norm via Grothendieck's inequality. SIAM Journal on Computing, 35(4), 787–803. https://doi.org/https://doi.org/10.1137/S0097539704441629
- Bertsekas, D. P. (1999). Nonlinear programming. Athena Scientific.
- Bertsekas, D. P., & Tsitsiklis, J. N. (1989). Parallel and distributed computation: Numerical methods (Vol. 23). Prentice Hall.
- Bhatia, N. P., & Szegö, G. P. (2002). Stability theory of dynamical systems. Springer.
- Bloemen, H. H. J., T. J. J. van den Boom, & Verbruggen, H. B. (2004). Optimization algorithms for bilinear model–based predictive control problems. AIChE Journal, 50(7), 1453–1461. https://doi.org/https://doi.org/10.1002/(ISSN)1547-5905
- Borwein, P., & Erdélyi, T. (2012). Polynomials and polynomial inequalities. Springer Science & Business Media.
- Byrd, R. H., Gilbert, J. C., & Nocedal, J. (2000). A trust region method based on interior point techniques for nonlinear programming. Mathematical Programming, 89(1), 149–185. https://doi.org/https://doi.org/10.1007/PL00011391
- Calafiore, G. C., & Possieri, C. (2018). A variation on a random coordinate minimization method for constrained polynomial optimization. IEEE Control Systems Letters, 2(3), 531–536. https://doi.org/https://doi.org/10.1109/LCSYS.2018.2843165
- Chesi, G., Tesi, A., Vicino, A., & Genesio, R. (2001). An LMI approach to constrained optimization with homogeneous forms. Systems & Control Letters, 42(1), 11–19. https://doi.org/https://doi.org/10.1016/S0167-6911(00)00072-4
- Collins, G. E., & Akritas, A. G (1976). Polynomial real root isolation using Descarte's rule of signs. In Proceedings of the third ACM symposium on symbolic and algebraic computation (pp. 272–275).
- Conn, A. R., Gould, N. I. M., & Toint, P. (1991). A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM Journal on Numerical Analysis, 28(2), 545–572. https://doi.org/https://doi.org/10.1137/0728030
- Conn, A. R., Gould, N. I. M., & Toint, P. (1997). A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Mathematics of Computation, 66(217), 261–288. https://doi.org/https://doi.org/10.1090/S0025-5718-97-00777-1
- Cox, D. A., Little, J., & O'Shea, D. (2015). Ideals, varieties, and algorithms. Springer.
- De Klerk, E. (2008). The complexity of optimizing over a simplex, hypercube or sphere: A short survey. Central European Journal of Operations Research, 16(2), 111–125. https://doi.org/https://doi.org/10.1007/s10100-007-0052-9
- Dorato, P. (2000). Quantified multivariate polynomial inequalities. The mathematics of practical control design problems. IEEE Control Systems, 20(5), 48–58. https://doi.org/https://doi.org/10.1109/37.872903
- Engwerda, J. (2005). LQ dynamic optimization and differential games. John Wiley & Sons.
- Gelfand, I. M., Kapranov, M., & Zelevinsky, A. (2008). Discriminants, resultants, and multidimensional determinants. Springer.
- Goebel, R., Sanfelice, R. G., & Teel, A. R. (2012). Hybrid dynamical systems. Princeton University Press.
- Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Longman Publishing.
- Grammatico, S., Subbaraman, A., & Teel, A. R. (2013). Discrete-time stochastic control systems: A continuous Lyapunov function implies robustness to strictly causal perturbations. Automatica, 49(10), 2939–2952. https://doi.org/https://doi.org/10.1016/j.automatica.2013.06.021
- Grippo, L., & Sciandrone, M. (2000). On the convergence of the block nonlinear Gauss–Seidel method under convex constraints. Operations Research Letters, 26(3), 127–136. https://doi.org/https://doi.org/10.1016/S0167-6377(99)00074-7
- Grüne, L., & Pannek, J (2011). Nonlinear model predictive control. In Nonlinear model predictive control: Theory and algorithms (pp. 43–66). Springer.
- Hanzon, B., & Jibetean, D. (2003). Global minimization of a multivariate polynomial using matrix methods. Journal of Global Optimization, 27(1), 1–23. https://doi.org/https://doi.org/10.1023/A:1024664432540
- Henrion, D., & Garulli, A. (Eds.). (2005). Positive polynomials in control. Springer.
- Henrion, D., & Korda, M. (2014). Convex computation of the region of attraction of polynomial control systems. IEEE Transactions on Automatic Control, 59(2), 297–312. https://doi.org/https://doi.org/10.1109/TAC.2013.2283095
- Henrion, D., & Lasserre, J. B.. (2003). GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Transactions on Mathematical Software (TOMS), 29(2), 165–194. https://doi.org/https://doi.org/10.1145/779359.779363
- Henrion, D., & Lasserre, J. B.. (2004). Solving nonconvex optimization problems. IEEE Control Systems, 24(3), 72–83. https://doi.org/https://doi.org/10.1109/MCS.2004.1299534
- Jacobi, T., & Prestel, A. (2001). Distinguished representations of strictly positive polynomials. Journal für die Reine und Angewandte Mathematik, 532, 223–83. https://doi.org/https://doi.org/10.1515/crll.2001.023
- Karush, W (1939). Minima of functions of several variables with inequalities as side conditions [Master's thesis]. University of Chicago.
- Kearfott, R. B., & Walster, G. W. (2000). On stopping criteria in verified nonlinear systems or optimization algorithms. ACM Transactions on Mathematical Software, 26(3), 373–389. https://doi.org/https://doi.org/10.1145/358407.358418
- Kuhn, H. W., & Tucker, A. W (1951). Nonlinear programming. In Proceedings of the Berkeley symposium on mathematical statistics and probability. Berkeley, CA: University California Press.
- Lasserre, J. B. (2001). Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization, 11(3), 796–817. https://doi.org/https://doi.org/10.1137/S1052623400366802
- Lasserre, J. B. (2015). An introduction to polynomial and semi-algebraic optimization (Vol. 52). Cambridge University Press.
- Li, Z., He, S., & Zhang, S. (2012). Approximation methods for polynomial optimization: Models, algorithms, and applications. Springer.
- Li, Q., Yuan, J., Zhang, B., & Gao, C. (2017). Model predictive control for autonomous rendezvous and docking with a tumbling target. Aerospace Science and Technology, 69, 700–711. https://doi.org/https://doi.org/10.1016/j.ast.2017.07.022
- Löfberg, J. (2009). Pre-and post-processing sum-of-squares programs in practice. IEEE Transactions on Automatic Control, 54(5), 1007–1011. https://doi.org/https://doi.org/10.1109/TAC.2009.2017144
- Mayne, D. Q., Rawlings, J. B., Rao, C. V., & Scokaert, P. O. (2000). Constrained model predictive control: Stability and optimality. Automatica, 36(6), 789–814. https://doi.org/https://doi.org/10.1016/S0005-1098(99)00214-9
- Menini, L., Possieri, C., & Tornambe, A. (2018a). Algebraic methods for multi-objective optimal design of control feedbacks for linear systems. IEEE Transactions on Automatic Control, 63(12), 4188–4203. https://doi.org/https://doi.org/10.1109/TAC.2018.2800784
- Menini, L., Possieri, C., & Tornambe, A. (2018b). Dead-beat regulation of mechanical juggling systems. Asian Journal of Control, 20(1), 1–11. https://doi.org/https://doi.org/10.1002/asjc.v20.1
- MOSEK ApS (2017). The MOSEK optimization toolbox for MATLAB manual (Version 8.1) [Computer software manual]. http://docs.mosek.com/8.1/toolbox/index.html.
- Necoara, I., & Clipici, D. (2013). Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: Application to distributed MPC. Journal of Process Control, 23(3), 243–253. https://doi.org/https://doi.org/10.1016/j.jprocont.2012.12.012
- Nesterov, Y. (1998). Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9(1-3), 141–160. https://doi.org/https://doi.org/10.1080/10556789808805690
- Nesterov, Y. (2012). Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM Journal on Optimization, 22(2), 341–362. https://doi.org/https://doi.org/10.1137/100802001
- Nesterov, Y. (2014). Subgradient methods for huge-scale optimization problems. Mathematical Programming, 146(1–2), 275–297. https://doi.org/https://doi.org/10.1007/s10107-013-0686-4
- Papachristodoulou, A., Anderson, J., Valmorbida, G., Prajna, S., Seiler, P., & Parrilo, P (2013). SOSTOOLS version 3.00 sum of squares optimization toolbox for MATLAB. arXiv:1310.4716.
- Parrilo, P. A (2000). Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization [Unpublished doctoral dissertation]. California Institute of Technology.
- Parrilo, P. A., & Sturmfels, B (2003). Minimizing polynomial functions. In S. Basu & L. González-Vega (Eds.), Algorithmic and quantitative real algebraic geometry: DIMACS series in discrete mathematics and theoretical computer science (pp. 83–99). American Mathematical Society.
- Possieri, C., & Sassano, M. (2016). On polynomial feedback Nash equilibria for two-player scalar differential games. Automatica, 74, 23–29. https://doi.org/https://doi.org/10.1016/j.automatica.2016.08.006
- Possieri, C., & Teel, A. R. (2017). A Lyapunov theorem certifying global weak reachability for stochastic difference inclusions with random inputs. Systems & Control Letters, 109, 37–42. https://doi.org/https://doi.org/10.1016/j.sysconle.2017.09.007
- Powell, M. J. (1973). On search directions for minimization algorithms. Mathematical Programming, 4(1), 193–201. https://doi.org/https://doi.org/10.1007/BF01584660
- Rastrigin, L. A. (1963). The convergence of the random search method in the extremal control of a many parameter system. Automation and Remote Control, 24, 1337–1342. https://doi.org/https://doi.org/10.1007/BF00935752
- Rheinboldt, W. C., Mesztenyi, C. K., & Fitzgerald, J. M. (1977). On the evaluation of multivariate polynomials and their derivatives. BIT, 17(4), 437–450. https://doi.org/https://doi.org/10.1007/BF01933453
- Richtárik, P., & Takáč, M. (2014). Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 144(1–2), 1–38. https://doi.org/https://doi.org/10.1007/s10107-012-0614-z
- Rockafellar, R. T., & Wets, R. J. B. (2009). Variational analysis. Springer.
- Rouillier, F. (1999). Solving zero-dimensional systems through the rational univariate representation. Applicable Algebra in Engineering, Communication and Computing, 9(5), 433–461. https://doi.org/https://doi.org/10.1007/s002000050114
- Rudin, W. (1964). Principles of mathematical analysis. McGraw-Hill.
- Schumer, M., & Steiglitz, K. (1968). Adaptive step size random search. IEEE Transactions on Automatic Control, 13(3), 270–276. https://doi.org/https://doi.org/10.1109/TAC.1968.1098903
- Shor, N. Z. (1987). Class of global minimum bounds of polynomial functions. Cybernetics and Systems Analysis, 23(6), 731–734. https://doi.org/https://doi.org/10.1007/BF01070233
- Solis, F. J., & Wets, R. J. B. (1981). Minimization by random search techniques. Mathematics of Operations Research, 6(1), 19–30. https://doi.org/https://doi.org/10.1287/moor.6.1.19
- Spall, J. C. (2005). Introduction to stochastic search and optimization: Estimation, simulation, and control (Vol. 65). John Wiley & Sons.
- Subbaraman, A., & Teel, A. R. (2013). A converse Lyapunov theorem for strong global recurrence. Automatica, 49(10), 2963–2974. https://doi.org/https://doi.org/10.1016/j.automatica.2013.07.001
- Szegohuml;, G. (1939). Orthogonal polynomials. American Mathematical Society.
- Teel, A. R. (2013). A Matrosov theorem for adversarial Markov decision processes. IEEE Transactions on Automatic Control, 58(8), 2142–2148. https://doi.org/https://doi.org/10.1109/TAC.2013.2250073
- Teel, A. R., Hespanha, J. P., & Subbaraman, A. (2014). A converse Lyapunov theorem and robustness for asymptotic stability in probability. IEEE Transactions on Automatic Control, 59(9), 2426–2441. https://doi.org/https://doi.org/10.1109/TAC.2014.2322431
- Tempo, R., Calafiore, G., & Dabbene, F. (2012). Randomized algorithms for analysis and control of uncertain systems. Springer.
- Thygesen, U. H (1997). A survey of Lyapunov techniques for stochastic differential equations (Tech. Rep. No. IMM 18-1997). Lyngby: Department of Mathematical Modeling, Technical University of Denmark.
- Tseng, P. (2001). Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of Optimization Theory and Applications, 109(3), 475–494. https://doi.org/https://doi.org/10.1023/A:1017501703105
- Tütüncü, R. H., Toh, K. C.., & Todd, M. J. (2003). Solving semidefinite-quadratic-linear programs using SDPT3. Mathematical Programming, 95(2), 189–217. https://doi.org/https://doi.org/10.1007/s10107-002-0347-5
- Verschelde, J (1999). Polynomial homotopies for dense, sparse and determinantal systems. arXiv:math/9907060.
- Wächter, A., & Biegler, L. T. (2006). On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1), 25–57. https://doi.org/https://doi.org/10.1007/s10107-004-0559-y
- Weiss, A., Baldwin, M., Erwin, R. S., & Kolmanovsky, I. (2015). Model predictive control for spacecraft rendezvous and docking: Strategies for handling constraints and case studies. IEEE Transactions on Control Systems Technology, 23(4), 1638–1647. https://doi.org/https://doi.org/10.1109/TCST.2014.2379639
- Wolkowicz, H., Saigal, R., & Vandenberghe, L. (2012). Handbook of semidefinite programming: Theory, algorithms, and applications (Vol. 27). Springer.
- Wright, S. J. (2015). Coordinate descent algorithms. Mathematical Programming, 151(1), 3–34. https://doi.org/https://doi.org/10.1007/s10107-015-0892-3
- Zabinsky, Z. B (2008). Global optimization: Hit and run methods. In C. Floudas & P. Pardalos (Eds.), Encyclopedia of optimization. Boston, MA: Springer.
- Zadeh, N. (1970). A note on the cyclic coordinate ascent method. Management Science, 16(9), 642–644. https://doi.org/https://doi.org/10.1287/mnsc.16.9.642