Abstract
Mehrotra-type predictor-corrector algorithms are the core of the interior point methods software packages. The example made by Salahi et al. recently has shown that a second-order modified version of Mehrotra-type predictor-corrector algorithm for linear optimization may be forced to take very small steps in order to remain in a certain neighborhood of the central path. This motivates them to introduce a safe strategy in order to guarantee a lower bound for the maximum feasible step in the corrector, and subsequently ensure the polynomial complexity. Based on their research, this paper extend the algorithm to convex quadratic optimization. The polynomial complexity of the new algorithm is derived, namely, \(\mathcal {O}\left(n\log\frac{(x^0)^Ts^0}{\epsilon}\right)\). Since the search directions are not orthogonal, the new algorithm is different from their method by the way of computing the barrier parameter and performing the complexity analysis.
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
Karmarkar, N.K.: A new ploynomial-time algorithm for liner programming. Combinatorice 4, 373–395 (1984)
Zhang, Y.: Solving large-scale linear programms by interior point methods under the Matlab enviroment. Optimization Methods and Software 10, 1–31 (1999)
Salahi, M., Peng, J., Terlaky, T.: On Mehrotra type predictor-corrector algorithms, Technical Report 2005/4, Advanced Optimization Lab, Department of Computing and Software, McMaster University, SIAM Journal on Optimization (2005)
Salahi, M., Mahdavi-Amiri, N.: Polynomial time second order Mehrotra-type predictor-corrector algoritms. Applied Mathematics and Computation 183, 646–658 (2006)
Peng, J., Roos, C., Terlaky, T.: Theory and Algorithms for Linear Optimization, An Interior-point Approach. John Wiley and Sons, Chichester (1997)
Chen, F., Zhang, H., Wu, Z.: Preliminary numerical texts in primal-dual interior-point methods for convex quadratic programming. Science Technology and Engineering (1), 97–99 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, Q., Zhang, M. (2010). A Second-Order Modified Version of Mehrotra-type Predictor-Corrector Algorithm for Convex Quadratic Optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-13498-2_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13497-5
Online ISBN: 978-3-642-13498-2
eBook Packages: Computer ScienceComputer Science (R0)