메뉴 건너뛰기




Volumn , Issue , 2008, Pages 4933-4938

On the approximate domain optimization of deterministic and expected value criteria

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV CHAINS; PROBABILITY DISTRIBUTIONS;

EID: 62949130564     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2008.4738753     Document Type: Conference Paper
Times cited : (5)

References (33)
  • 2
    • 0001109213 scopus 로고
    • Simulated annealing process in general state space
    • H. Haario and E. Saksman, "Simulated annealing process in general state space," Adv. Appl. Prob., vol. 23, pp. 866-893, 1991.
    • (1991) Adv. Appl. Prob , vol.23 , pp. 866-893
    • Haario, H.1    Saksman, E.2
  • 3
    • 52449148813 scopus 로고
    • Simulated annealing type algorithms for multivariate optimization
    • S. B. Gelfand and S. K. Mitter, "Simulated annealing type algorithms for multivariate optimization," Algorithmica, vol. 6, pp. 419-436, 1991.
    • (1991) Algorithmica , vol.6 , pp. 419-436
    • Gelfand, S.B.1    Mitter, S.K.2
  • 4
    • 0030288972 scopus 로고    scopus 로고
    • Generalized simulated annealing
    • C. Tsallis and D.A. Stariolo, "Generalized simulated annealing," Physica A, vol. 233, pp. 395-406, 1996.
    • (1996) Physica A , vol.233 , pp. 395-406
    • Tsallis, C.1    Stariolo, D.A.2
  • 5
    • 0034349453 scopus 로고    scopus 로고
    • Simulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions
    • M. Locatelli, "Simulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions," J. Optimiz. Theory App., vol. 104, no. 1, pp. 121-133, 2000.
    • (2000) J. Optimiz. Theory App , vol.104 , Issue.1 , pp. 121-133
    • Locatelli, M.1
  • 7
    • 0001345363 scopus 로고
    • Convergence and finite-time behavior of simulated annealing
    • D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli, "Convergence and finite-time behavior of simulated annealing," Adv. Appl. Prob., vol. 18, pp. 747-771, 1986.
    • (1986) Adv. Appl. Prob , vol.18 , pp. 747-771
    • Mitra, D.1    Romeo, F.2    Sangiovanni-Vincentelli, A.3
  • 8
    • 0024012393 scopus 로고
    • Cooling schedules for optimal annealing
    • B. Hajek, "Cooling schedules for optimal annealing," Mathematics of Operations Research, vol. 13, pp. 311-329, 1988.
    • (1988) Mathematics of Operations Research , vol.13 , pp. 311-329
    • Hajek, B.1
  • 9
    • 33646739188 scopus 로고    scopus 로고
    • Relative Frequencies of Generalized Simulated Annealing
    • J. Hannig, E. K. P. Chong, and S. R. Kulkarni, "Relative Frequencies of Generalized Simulated Annealing," Math. Oper. Res., vol. 31, no. 1, pp. 199-216, 2006.
    • (2006) Math. Oper. Res , vol.31 , Issue.1 , pp. 199-216
    • Hannig, J.1    Chong, E.K.P.2    Kulkarni, S.R.3
  • 13
    • 0007190954 scopus 로고    scopus 로고
    • Simulation based optimal design
    • J. O. Berger, J. M. Bernardo, A. P. Dawid, and A. F. M. Smith, Eds, Oxford: Clarendon Press
    • P. Müller, "Simulation based optimal design," in Bayesian Statistics 6: proceedings of the Sixth Valencia International Meeting, J. O. Berger, J. M. Bernardo, A. P. Dawid, and A. F. M. Smith, Eds. 1999, pp. 459-474, Oxford: Clarendon Press.
    • (1999) Bayesian Statistics 6: Proceedings of the Sixth Valencia International Meeting , pp. 459-474
    • Müller, P.1
  • 14
    • 0141567816 scopus 로고    scopus 로고
    • Marginal maximum a posteriori estimation using Markov chain Monte Carlo
    • A. Doucet, S.J. Godsill, and P. Robert, "Marginal maximum a posteriori estimation using Markov chain Monte Carlo," Statistics and Computing, vol. 12, pp. 77-84, 2002.
    • (2002) Statistics and Computing , vol.12 , pp. 77-84
    • Doucet, A.1    Godsill, S.J.2    Robert, P.3
  • 16
    • 62949137639 scopus 로고    scopus 로고
    • Approximate domain optimization for deterministic and expected value criteria,
    • Tech. Rep. AUT08-03, Automatic Control Laboratory, ETH Zurich, March
    • A. Lecchini Visintini, J. Lygeros, and Jan M. Maciejowski, "Approximate domain optimization for deterministic and expected value criteria," Tech. Rep. AUT08-03, Automatic Control Laboratory, ETH Zurich, March 2008.
    • (2008)
    • Lecchini Visintini, A.1    Lygeros, J.2    Maciejowski, J.M.3
  • 17
    • 85162062799 scopus 로고    scopus 로고
    • Simulated annealing: Rigorous finite-time guarantees for optimization on continuous domains
    • Vancouver, B.C, Canada, December 3-6
    • A. Lecchini-Visintini, J. Lygeros, and J. Maciejowski, "Simulated annealing: Rigorous finite-time guarantees for optimization on continuous domains," in Neural Information Processing Systems (NIPS07), Vancouver, B.C., Canada, December 3-6 2007.
    • (2007) Neural Information Processing Systems (NIPS07)
    • Lecchini-Visintini, A.1    Lygeros, J.2    Maciejowski, J.3
  • 19
    • 45249124485 scopus 로고    scopus 로고
    • Parameter identification for stochastic hybrid systems using randomized optimization: A case study on subtilin production by Bacillus Subtilis
    • August
    • K. Koutroumpas, E. Cinquemani, P. Kouretas, and J. Lygeros, "Parameter identification for stochastic hybrid systems using randomized optimization: A case study on subtilin production by Bacillus Subtilis," Nonlinear Analysis: Hybrid Systems, vol. 2, no. 3, pp. 786-802, August 2008.
    • (2008) Nonlinear Analysis: Hybrid Systems , vol.2 , Issue.3 , pp. 786-802
    • Koutroumpas, K.1    Cinquemani, E.2    Kouretas, P.3    Lygeros, J.4
  • 20
    • 34547432490 scopus 로고    scopus 로고
    • Stochastic programming approach to optimization under uncertainty
    • A. Shapiro, "Stochastic programming approach to optimization under uncertainty," Mathematical Programming, Series B, vol. 112, pp. 183-220, 2008.
    • (2008) Mathematical Programming, Series B , vol.112 , pp. 183-220
    • Shapiro, A.1
  • 21
    • 0035480306 scopus 로고    scopus 로고
    • Randomized algorithms for robust controller synthesis using statistical learning theory
    • M. Vidyasagar, "Randomized algorithms for robust controller synthesis using statistical learning theory," Automatica, vol. 37, pp. 1515-1528, 2000.
    • (2000) Automatica , vol.37 , pp. 1515-1528
    • Vidyasagar, M.1
  • 23
    • 51849106154 scopus 로고    scopus 로고
    • Primal-dual subgradient methods for convex problems,
    • Tech. Rep. 2005/67, CORE, 2005
    • Yu. Nesterov, "Primal-dual subgradient methods for convex problems," Tech. Rep. 2005/67, CORE, 2005.
    • Nesterov, Y.1
  • 24
    • 33644697284 scopus 로고    scopus 로고
    • The empirical behavior of sampling methods for stochastic programming
    • J. Linderoth, A. Shapiro, and S. Wright, "The empirical behavior of sampling methods for stochastic programming," Annals of Operations Research, vol. 142, pp. 215-241, 2006.
    • (2006) Annals of Operations Research , vol.142 , pp. 215-241
    • Linderoth, J.1    Shapiro, A.2    Wright, S.3
  • 25
    • 62949130392 scopus 로고    scopus 로고
    • Confidence level solutions for stochastic programming,
    • Tech. Rep. 2000/13, CORE, 2000
    • J.-Ph. Vial and Yu. Nesterov, "Confidence level solutions for stochastic programming," Tech. Rep. 2000/13, CORE, 2000.
    • Vial, J.-P.1    Nesterov, Y.2
  • 27
    • 0002740591 scopus 로고
    • Geometric bounds for eigenvalues of Markov chains
    • P. Diaconis and D. Strook, "Geometric bounds for eigenvalues of Markov chains," The Annals of Applied Probability, vol. 1, no. 1, pp. 36-61, 1991.
    • (1991) The Annals of Applied Probability , vol.1 , Issue.1 , pp. 36-61
    • Diaconis, P.1    Strook, D.2
  • 29
    • 84923618271 scopus 로고
    • Minorization conditions and convergence rates for Markov chain Monte Carlo
    • J.S. Rosenthal, "Minorization conditions and convergence rates for Markov chain Monte Carlo," Journal of the American Statistical Association, vol. 90, no. 430, pp. 558-566, 1995.
    • (1995) Journal of the American Statistical Association , vol.90 , Issue.430 , pp. 558-566
    • Rosenthal, J.S.1
  • 30
    • 14544282666 scopus 로고    scopus 로고
    • Quantitative bounds on convergence of time-inhomogeneous Markov chains
    • R. Douc, E. Moulines, and J.S. Rosenthal, "Quantitative bounds on convergence of time-inhomogeneous Markov chains," The Annals of Applied Probability, vol. 14, no. 4, pp. 1643-1665, 2004.
    • (2004) The Annals of Applied Probability , vol.14 , Issue.4 , pp. 1643-1665
    • Douc, R.1    Moulines, E.2    Rosenthal, J.S.3
  • 31
    • 84890736685 scopus 로고    scopus 로고
    • General state space Markov chains and MCMC algorithms
    • G.O. Roberts and J.S. Rosenthal, "General state space Markov chains and MCMC algorithms," Probability Surveys, vol. 1, pp. 20-71, 2004.
    • (2004) Probability Surveys , vol.1 , pp. 20-71
    • Roberts, G.O.1    Rosenthal, J.S.2
  • 32
    • 0030551974 scopus 로고    scopus 로고
    • Rates of convergence of the Hastings and Metropolis algorithm
    • K.L. Mengersen and R.L. Tweedie, "Rates of convergence of the Hastings and Metropolis algorithm," The annals of Statistics, vol. 24, no. 1, pp. 101-121, 1996.
    • (1996) The annals of Statistics , vol.24 , Issue.1 , pp. 101-121
    • Mengersen, K.L.1    Tweedie, R.L.2
  • 33
    • 26444453617 scopus 로고    scopus 로고
    • Simulated annealing beats Metropolis in combinatorial optimization
    • ICALP 2005, L. Caires, G.F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, Eds, number in, Springer-Verlag, Heidelberg
    • I. Wegener, "Simulated annealing beats Metropolis in combinatorial optimization," in ICALP 2005, L. Caires, G.F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, Eds., number 3580 in LNCS, pp. 589-601. Springer-Verlag, Heidelberg, 2005.
    • (2005) LNCS , vol.3580 , pp. 589-601
    • Wegener, I.1


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