Abstract
The goal of this paper is to present an application to binary image least-squares estimation of some recent results in the semi-definite programming approximation theory of some combinatorial problems due to Goemans and Williamson, Yu. Nesterov and others. In particular, we show in a very simple fashion that a good suboptimal solution may be obtained via eigenvalue optimization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goemans M. and Williamson D., Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming. Journal of the ACM (1996).
Hiriart-Urruty J.-B. and Lemaréchal C., Convex analysis and optimization algorithms, Springer (1993).
Nesterov Yu., Quality of semi-definite relaxation for nonconvex quadratic optimization, Core discussion paper 9719 Center for Operations Research & Econometrics, Louvain-la-Neuve (1997)
Oustry F., A second order bundle method to minimize the maximum eigen-value function, Math. Programming, 89 no. 1 Ser. A, pp. 1–30 (2000).
Chrétien S. and Corset F., Eigenvalue relaxation of some binary linear least-squares estimation problems, Technical Report, Mathematics department, Université de Franche-Comté, in preparation.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chrétien, S., Corset, F. (2002). Least Squares Reconstruction of Binary Images using Eigenvalue Optimization. In: Härdle, W., Rönz, B. (eds) Compstat. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-57489-4_63
Download citation
DOI: https://doi.org/10.1007/978-3-642-57489-4_63
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1517-7
Online ISBN: 978-3-642-57489-4
eBook Packages: Springer Book Archive