A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
MetadataShow full item record
In this paper, we generalize the classical primal–dual logarithmic barrier method for linear optimization to convex quadratic optimization over symmetric cone by using Euclidean Jordan algebras. The symmetrization of the search directions used in this paper is based on the Nesterov–Todd scaling scheme, and only full Nesterov–Todd step is used at each iteration. We derive the iteration bound that matches the currently best known iteration bound for small-update methods, namely, O(√rlog4/ε. Some preliminary numerical results are provided to demonstrate the computational performance of the proposed algorithm.
Showing items related by title, author, creator and subject.
Li, Bin (2011)In this thesis, we consider several types of optimal control problems with constraints on the state and control variables. These problems have many engineering applications. Our aim is to develop efficient numerical methods ...
Yu, Changjun (2012)In this thesis, We propose new computational algorithms and methods for solving four classes of constrained optimization and optimal control problems. In Chapter 1, we present a brief review on optimization and ...
Zhou, Jingyang (2011)In this thesis, we deal with several optimal guidance and control problems of the spacecrafts arising from the study of lunar exploration. The research is composed of three parts: 1. Optimal guidance for the lunar module ...