Abstract
In this paper, we consider the computation of a rigorous lower error bound for the optimal value of convex optimization problems. A discussion of large-scale problems, degenerate problems, and quadratic programming problems is included. It is allowed that parameters, whichdefine the convex constraints and the convex objective functions, may be uncertain and may vary between given lower and upper bounds. The error bound is verified for the family of convex optimization problems which correspond to these uncertainties. It can be used to perform a rigorous sensitivity analysis in convex programming, provided the width of the uncertainties is not too large. Branch and bound algorithms can be made reliable by using such rigorous lower bounds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alefeld, G. and Herzberger, J., (1983) Introduction to Interval Computations. Academic Press, New York.
Borchers, B. and Mitchell, J.E., (1994). An improved branch and bound algorithm for mixed integer nonlinear Programs. Computers Ops Res., 21(4), 359–367.
Floudas, C.A., (2000). Deterministic Global Optimization — Theory, Methods and Applications, volume 37 of Nonconvex Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht, Boston, London.
Floudas, C.A. and Pardalos, P.M., (2001). Encyclopedia of Optimization. Kluwer Academic Publishers.
Griewank, A., (1989). On Automatic Differentiation, volume 88 of Mathematical Programming. Kluwer Academic Publishers, Boston MA.
Jansson, C., 2002. Rigorous lower and upper bounds in linear programming. Technical Report 02.1, Forschungsschwerpunkt Informations-und Kommunikationstechnik, TU Hamburg-Harburg. http://www.ti3.tu-harburg.de/paper/jansson/verification.ps.
Moore, R.E., (1979). Methods and Applications of Interval Analysis. SIAM, Philadelphia, PA.
NETLIB Linear Programming Library. http://www.netlib.org/lp.
Neumaier, A., (1990). Interval methods for systems of equations. In: Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge.
Neumaier, A., (2001). Introduction to Numerical Analysis. Cambridge University Press, Cambridge.
Neumaier, A. and Shcherbina, O. Safe bounds in linear and mixed-integer programming. http://www.mat.univie.ac.at/~neum/papers.html.
Ordóñez, F. and Freund, R.M., (2002). Computational experience and the explanatory value of condition numbers for linear optimization. Technical Report MIT Operations Research Center Working Paper OR361-02, MIT. submitted for publication to SIAM J. Optimization. http://web.mit.edu/rfreund/www/CVfreund.pdf.
Rall, L.B. and Corliss, G.F., (1999). Automatic differentiation: Point and interval AD. In Pardalos, P.M. and Floudas, C.A. (eds.), Encyclopedia of Optimization. Kluwer, Dordrecht.
Rump, S.M., (1993). Validated solution of large linear systems. In: Albrecht, R., Alefeld, G. and Stetter, H.J., (eds), Validation numerics: Theory and Applications, volume 9 of Computing Supplementum, Springer, Berlin, pp. 191–212.
Tawaralani, M. and Sahinidis, N.V., (2002). Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Kluwer Academic Publishers.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jansson, C. A Rigorous Lower Bound for the Optimal Value of Convex Optimization Problems. Journal of Global Optimization 28, 121–137 (2004). https://doi.org/10.1023/B:JOGO.0000006720.68398.8c
Issue Date:
DOI: https://doi.org/10.1023/B:JOGO.0000006720.68398.8c