Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Convexification for data fitting

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

An Erratum to this article was published on 14 April 2009

Abstract

The main results reported in this paper are two theorems concerning the use of a newtype of risk-averting error criterion for data fitting. The first states that the convexity region of the risk-averting error criterion expands monotonically as its risk-sensitivity index increases. The risk-averting error criterion is easily seen to converge to the mean squared error criterion as its risk-sensitivity index goes to zero. Therefore, the risk-averting error criterion can be used to convexify the mean squared error criterion to avoid local minima. The second main theorem shows that as the risk-sensitivity index increases to infinity, the risk-averting error criterion approaches the minimax error criterion, which is widely used for robustifying system controllers and filters.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Basar T., Bernhard P.: H-infinity Optimal Control and Related Minimax Design Problems: A Dynamic Game Approach. 2nd edn. Birkhauser, Boston (1995)

    Google Scholar 

  2. Blake A., Zisserman A.: Visual Reconstruction. The MIT Press, Cambridge (1987)

    Google Scholar 

  3. Glover K., Doyle J.C.: State-space formulae for all stabilizing controllers that satisfy an H-infinity norm bound and relations to risk-sensitivity. Syst. Control Lett. 11, 167–172 (1988)

    Article  Google Scholar 

  4. Huber P.: Robust Statistics. Wiley, New York (1982)

    Google Scholar 

  5. Jacobson D.H.: Optimal stochastic linear systems with exponential performance criteria and their relation to deterministic games. IEEE Trans. Automat. Contr. AC-18(2), 124–131 (1973)

    Article  Google Scholar 

  6. Liu W.B., Floudas C.A.: A remark on the GOP algorithm for global optimization. J. Glob. Optim. 3, 519–531 (1993)

    Article  Google Scholar 

  7. Lo, J.T.-H., Bassu, D.: An adaptive method of training multilayer perceptrons. In: Proceedings of the 2001 International Joint Conference on Neural Networks, vol. 3, pp. 2013–2018. IEEE Xplore, The IEEE Press, Piscataway (2001)

  8. Lo, J.T.-H., Bassu, D.: Robust identification of dynamic systems by neurocomputing. In: Proceedings of the 2001 International Joint Conference on Neural Networks, vol. 2, pp. 1285–1290. IEEE Xplore, The IEEE Press, Piscataway (2001)

  9. Lo, J.T.-H., Bassu, D.: Robust approximation of uncertain functions where adaptation is impossible. In: Proceedings of the 2002 International Joint Conference on Neural Networks, vol. 2, pp. 1956–1961. IEEE Xplore, The IEEE Press, Piscataway (2002)

  10. Lo, J.T.-H., Bassu, D.: Robust identification of uncertain dynamical systems where adaptation is impossible. In: Proceedings of the 2002 International Joint Conference on Neural Networks, vol. 2, pp. 1558–1563. IEEE Xplore, The IEEE Press, Piscataway (2002)

  11. Speyer J., Deyst J., Jacobson D.H.: Optimization of stochastic linear systems with additive measurement and process noise using exponential performance criteria. IEEE Trans. Automat. Contr. AC-19, 358–366 (1974)

    Article  Google Scholar 

  12. Whittle P.: Risk Sensitive Optimal Control. Wiley, New York (1990)

    Google Scholar 

  13. Zlobec S.: On the Liu–Floudas convexification of smooth programs. J. Glob. Optim. 32, 401–407 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to James Ting-Ho Lo.

Additional information

This material is based upon work supported in part by the National Science Foundation and Army Research Office, but does not necessarily reflect the position or policy of the Government.

An erratum to this article can be found at http://dx.doi.org/10.1007/s10898-009-9421-3

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lo, J.TH. Convexification for data fitting. J Glob Optim 46, 307–315 (2010). https://doi.org/10.1007/s10898-009-9417-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-009-9417-z

Keywords

Mathematics Subject Classification (2000)

Navigation