메뉴 건너뛰기




Volumn 47, Issue 9, 2011, Pages 2016-2022

A global piecewise smooth Newton method for fast large-scale model predictive control

Author keywords

Large scale systems; Model predictive control; Online optimization

Indexed keywords

ACTIVE SETS; AVERAGE RUNNING TIME; BENCH-MARK PROBLEMS; CONSTRAINED LINEAR SYSTEMS; CRUDE DISTILLATION UNITS; INTERIOR POINT ALGORITHM; LARGE-SCALE PROBLEM; LINE SEARCHES; MERIT FUNCTION; ONLINE OPTIMIZATION; ORDERS OF MAGNITUDE; PIECEWISE AFFINES; PIECEWISE SMOOTH; QP SOLVERS; QUADRATIC PROGRAMS;

EID: 80052029647     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.automatica.2011.05.024     Document Type: Article
Times cited : (47)

References (30)
  • 1
    • 62949181452 scopus 로고    scopus 로고
    • A dual gradient projection quadratic programming algorithm tailored for model predictive control
    • Axehill, D., & Hansson, A. (2008). A dual gradient projection quadratic programming algorithm tailored for model predictive control, In 47th IEEE conference on decision and control, 2008 (pp. 30573064).
    • (2008) 47th IEEE Conference on Decision and Control, 2008 , pp. 3057-3064
    • Axehill, D.1    Hansson, A.2
  • 2
    • 0036027604 scopus 로고    scopus 로고
    • The explicit linear quadratic regulator for constrained systems
    • DOI 10.1016/S0005-1098(01)00174-1, PII S0005109801001741
    • A. Bemporad, M. Morari, V. Dua, and E. Pistikopoulos The explicit linear quadratic regulator for constrained systems Automatica 38 1 2002 3 20 (Pubitemid 33034535)
    • (2002) Automatica , vol.38 , Issue.1 , pp. 3-20
    • Bemporad, A.1    Morari, M.2    Dua, V.3    Pistikopoulos, E.N.4
  • 5
    • 0348229157 scopus 로고    scopus 로고
    • On Newton's method for Huber's robust M-estimation problems in linear regression
    • B. Chen, and M.C. Pinar On Newton's method for Huber's robust M-estimation problems in linear regression BIT Numerical Mathematics 38 4 1998 674 684 (Pubitemid 128434738)
    • (1998) BIT Numerical Mathematics , vol.38 , Issue.4 , pp. 674-684
    • Chen, B.1    Pinar, M.C.2
  • 8
    • 44349127211 scopus 로고    scopus 로고
    • An online active set strategy to overcome the limitations of explicit MPC
    • DOI 10.1002/rnc.1251
    • H.J. Ferreau, H.G. Bock, and M. Diehl An online active set strategy to overcome the limitations of explicit MPC International Journal of Robust and Nonlinear Control 18 8 2008 816 830 (Pubitemid 351743519)
    • (2008) International Journal of Robust and Nonlinear Control , vol.18 , Issue.8 , pp. 816-830
    • Ferreau, H.J.1    Bock, H.G.2    Diehl, M.3
  • 9
    • 0035400417 scopus 로고    scopus 로고
    • Equivalence of hybrid dynamical models
    • DOI 10.1016/S0005-1098(01)00059-0, PII S0005109801000590
    • W.P.M.H. Heemels, B. De Schutter, and A. Bemporad Equivalence of hybrid dynamical models Automatica 37 7 2001 1085 1091 (Pubitemid 32498993)
    • (2001) Automatica , vol.37 , Issue.7 , pp. 1085-1091
    • Heemels, W.P.M.H.1    De Schutter, B.2    Bemporad, A.3
  • 12
    • 0029377865 scopus 로고
    • Error bounds for piecewise convex quadratic programs and applications
    • W. Li Error bounds for piecewise convex quadratic programs and applications SIAM Journal on Control and Optimization 33 5 1995 1510 1529
    • (1995) SIAM Journal on Control and Optimization , vol.33 , Issue.5 , pp. 1510-1529
    • Li, W.1
  • 13
    • 0031285891 scopus 로고    scopus 로고
    • A new algorithm for solving strictly convex quadratic programs
    • W. Li, and J. Swetits A new algorithm for solving strictly convex quadratic programs SIAM Journal on Optimization 7 3 1997 595 619
    • (1997) SIAM Journal on Optimization , vol.7 , Issue.3 , pp. 595-619
    • Li, W.1    Swetits, J.2
  • 14
    • 0012102518 scopus 로고    scopus 로고
    • Regularized Newton methods for minimization of convex quadratic splines with singular hessians
    • M. Fukushima, L. Qi, Kluwer Academic Publishers
    • W. Li, and J. Swetits Regularized Newton methods for minimization of convex quadratic splines with singular hessians M. Fukushima, L. Qi, Reformulation: nonsmooth, piecewise smooth, semismooth and smoothing methods 1999 Kluwer Academic Publishers 235 257
    • (1999) Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods , pp. 235-257
    • Li, W.1    Swetits, J.2
  • 15
    • 0026839499 scopus 로고
    • On the linear convergence of descent methods for convex essentially smooth minimization
    • Z.-Q. Luo, and P. Tseng On the linear convergence of descent methods for convex essentially smooth minimization SIAM Journal on Control and Optimization 30 2 1992 408 425
    • (1992) SIAM Journal on Control and Optimization , vol.30 , Issue.2 , pp. 408-425
    • Luo, Z.-Q.1    Tseng, P.2
  • 16
    • 21344480786 scopus 로고
    • Error bounds and convergence analysis of feasible descent methods: A general approach
    • Z.-Q. Luo, and P. Tseng Error bounds and convergence analysis of feasible descent methods: a general approach Annals of Operations Research 4647 1 1993 157 178
    • (1993) Annals of Operations Research , vol.46-47 , Issue.1 , pp. 157-178
    • Luo, Z.-Q.1    Tseng, P.2
  • 17
    • 0000793765 scopus 로고
    • Finite algorithms for robust linear regression
    • K. Madsen, and H. Nielsen Finite algorithms for robust linear regression BIT Numerical Mathematics 30 4 1990 682 699
    • (1990) BIT Numerical Mathematics , vol.30 , Issue.4 , pp. 682-699
    • Madsen, K.1    Nielsen, H.2
  • 18
    • 0036817951 scopus 로고    scopus 로고
    • A finite Newton method for classification
    • DOI 10.1080/1055678021000028375
    • O.L. Mangasarian A finite Newton method for classification Optimization Methods and Software 17 5 2002 913 929 (Pubitemid 35476480)
    • (2002) Optimization Methods and Software , vol.17 , Issue.5 , pp. 913-929
    • Mangasarian, O.L.1
  • 19
    • 0033876326 scopus 로고    scopus 로고
    • Constrained model predictive control: Stability and optimality
    • DOI 10.1016/S0005-1098(99)00214-9
    • D.Q. Mayne, J.B. Rawlings, C.V. Rao, and P.O.M. Scokaert Constrained model predictive control: stability and optimality Automatica 36 6 2000 789 814 (Pubitemid 30587683)
    • (2000) Automatica , vol.36 , Issue.6 , pp. 789-814
    • Mayne, D.Q.1    Rawlings, J.B.2    Rao, C.V.3    Scokaert, P.O.M.4
  • 20
    • 0000561116 scopus 로고
    • On the implementation of a primaldual interior point method
    • S. Mehrotra On the implementation of a primaldual interior point method SIAM Journal on Optimization 2 4 1992 575 601
    • (1992) SIAM Journal on Optimization , vol.2 , Issue.4 , pp. 575-601
    • Mehrotra, S.1
  • 21
    • 1642618002 scopus 로고    scopus 로고
    • BPMPD interior point solver for convex quadratic problems
    • C. Mészáros BPMPD interior point solver for convex quadratic problems Optimization Methods and Software 11 1 1999 431 449
    • (1999) Optimization Methods and Software , vol.11 , Issue.1 , pp. 431-449
    • Mészáros, C.1
  • 22
    • 34548480020 scopus 로고
    • A method of solving a convex programming problem with convergence rate O (1 k 2)
    • Y. Nesterov A method of solving a convex programming problem with convergence rate O (1 k 2) Soviet Mathematics Doklady 27 1983 372 376
    • (1983) Soviet Mathematics Doklady , vol.27 , pp. 372-376
    • Nesterov, Y.1
  • 24
    • 33947719861 scopus 로고    scopus 로고
    • Fast, large-scale model predictive control by partial enumeration
    • DOI 10.1016/j.automatica.2006.10.019, PII S0005109806004511
    • G. Pannocchia, J.B. Rawlings, and S.J. Wright Fast, large-scale model predictive control by partial enumeration Automatica 43 5 2007 852 860 (Pubitemid 46507426)
    • (2007) Automatica , vol.43 , Issue.5 , pp. 852-860
    • Pannocchia, G.1    Rawlings, J.B.2    Wright, S.J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.