메뉴 건너뛰기




Volumn 46, Issue 9, 2010, Pages 1540-1545

Convex relaxations for mixed integer predictive control

Author keywords

Finite alphabet control; Hybrid systems; Integer programming; Predictive control; Semidefinite programming

Indexed keywords

CONTROL PROBLEMS; CONTROL SIGNAL; CONVEX RELAXATION; FINITE ALPHABET CONTROL; INEQUALITY CONSTRAINT; MIXED INTEGER PREDICTIVE CONTROL; NUMERICAL EXPERIMENTS; OBJECTIVE FUNCTIONS; PREDICTIVE CONTROL; PROBLEM DESCRIPTION; SDP RELAXATION; SEMI-DEFINITE PROGRAMMING; SUBOPTIMAL SOLUTION;

EID: 77956173209     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.automatica.2010.06.015     Document Type: Article
Times cited : (41)

References (22)
  • 2
    • 62749136187 scopus 로고    scopus 로고
    • Relaxations applicable to mixed integer predictive control - comparisons and efficient computations
    • DOI 10.1109/CDC.2007.4434608, 4434608, Proceedings of the 46th IEEE Conference on Decision and Control 2007, CDC
    • Axehill, D., Hansson, A., & Vandenberghe, L. (2007). Relaxations applicable to mixed integer predictive controlcomparisons and efficient computations. In Proceedings of the 46th IEEE conference on decision and control, New Orleans, USA (pp. 41034109). (Pubitemid 351277789)
    • (2007) Proceedings of the IEEE Conference on Decision and Control , pp. 4103-4109
    • Axehill, D.1    Hansson, A.2    Vandenberghe, L.3
  • 3
    • 62749136187 scopus 로고    scopus 로고
    • Relaxations applicable to mixed integer predictive control - comparisons and efficient computations
    • DOI 10.1109/CDC.2007.4434608, 4434608, Proceedings of the 46th IEEE Conference on Decision and Control 2007, CDC
    • Axehill, D., Vandenberghe, L., & Hansson, A. (2007). On relaxations applicable to model predictive control for systems with binary control signals. In Preprints of the 7th IFAC symposium on nonlinear control systems, Pretoria, South Africa(pp. 200205). (Pubitemid 351277789)
    • (2007) Proceedings of the IEEE Conference on Decision and Control , pp. 4103-4109
    • Axehill, D.1    Hansson, A.2    Vandenberghe, L.3
  • 5
    • 0033097938 scopus 로고    scopus 로고
    • Control of systems integrating logic, dynamics, and constraints
    • A. Bemporad, and M. Morari Control of systems integrating logic, dynamics, and constraints Automatica 35 3 1999 407 427
    • (1999) Automatica , vol.35 , Issue.3 , pp. 407-427
    • Bemporad, A.1    Morari, M.2
  • 6
    • 0005325563 scopus 로고    scopus 로고
    • Semidefinite relaxations, multivariate normal distributions, and order statistics
    • Kluwer Academic Publishers
    • D. Bertsimas, and Y. Ye Semidefinite relaxations, multivariate normal distributions, and order statistics Handbook of combinatorial optimization Vol. 3 1998 Kluwer Academic Publishers 1 19 chapter
    • (1998) Handbook of Combinatorial Optimization , vol.3 , pp. 1-19
    • Bertsimas, D.1    Ye, Y.2
  • 7
    • 33845295475 scopus 로고    scopus 로고
    • Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem
    • DOI 10.1007/s10107-005-0637-9
    • A. Billionnet, and S. Elloumi Using a mixed integer quadratic programming solver for the unconstrained quadratic 01 problem Mathematical Programming 109 1 2007 55 68 (Pubitemid 44874466)
    • (2007) Mathematical Programming , vol.109 , Issue.1 , pp. 55-68
    • Billionnet, A.1    Elloumi, S.2
  • 8
    • 0032222085 scopus 로고    scopus 로고
    • Numerical Experience with Lower Bounds for MIQP Branch-and-Bound
    • R. Fletcher, and S. Leyffer Numerical experience with lower bounds for MIQP branch-and-bound SIAM Journal on Optimization 8 2 1998 604 616 (Pubitemid 128078214)
    • (1998) SIAM Journal on Optimization , vol.8 , Issue.2 , pp. 604-616
    • Fletcher, R.1    Leyffer, S.2
  • 9
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M.X. Goemans, and D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Journal of the ACM 42 6 1995 1115 1145
    • (1995) Journal of the ACM , vol.42 , Issue.6 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 11
    • 0041353723 scopus 로고    scopus 로고
    • Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes
    • PII S0025561097001111
    • C. Helmberg, and F. Rendl Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes Mathematical Programming 82 3 1998 291 315 (Pubitemid 128388096)
    • (1998) Mathematical Programming, Series B , vol.82 , Issue.3 , pp. 291-315
    • Helmberg, C.1    Rendl, F.2
  • 12
    • 0035238864 scopus 로고    scopus 로고
    • Global Optimization with Polynomials and the Problem of Moments
    • DOI 10.1137/S1052623400366802
    • J.B. Lasserre Global optimization with polynomials and the problem of moments SIAM Journal on Optimization 11 3 2001 796 817 (Pubitemid 33312508)
    • (2001) SIAM Journal on Optimization , vol.11 , Issue.3 , pp. 796-817
    • Lasserre, J.B.1
  • 13
    • 19944415349 scopus 로고    scopus 로고
    • A comparison of implementation strategies for MPC
    • B. Lie, M. Dueas Dez, and T.A. Hauge A comparison of implementation strategies for MPC Modeling, identification and control 26 1 2005 39 50 (Pubitemid 40749489)
    • (2005) Modeling, Identification and Control , vol.26 , Issue.1 , pp. 39-50
    • Lie, B.1    Diez, M.D.2    Hauge, T.A.3
  • 18
    • 0842274717 scopus 로고    scopus 로고
    • Semidefinite programming relaxations and algebraic optimization in control
    • DOI 10.3166/ejc.9.307-321
    • P.A. Parrilo, and S. Lall Semidefinite programming relaxations and algebraic optimization in control European Journal of Control 9 23 2003 307 321 (Pubitemid 44642227)
    • (2003) European Journal of Control , vol.9 , Issue.2-3 , pp. 307-321
    • Parrilo, P.A.1    Lall, S.2
  • 22
    • 0000549997 scopus 로고    scopus 로고
    • Approximating quadratic programming with bound constraints
    • Y. Ye Approximating quadratic programming with bound constraints Mathematical Programming 84 2 1999 219 226
    • (1999) Mathematical Programming , vol.84 , Issue.2 , pp. 219-226
    • Ye, Y.1


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