Analysis of some interior point continuous trajectories for convex programming
MetadataShow full item record
In this paper, we analyse three interior point continuous trajectories for convex programming with general linear constraints. The three continuous trajectories are derived from the primal–dual path-following method, the primal–dual affine scaling method and the central path, respectively. Theoretical properties of the three interior point continuous trajectories are fully studied. The optimality and convergence of all three interior point continuous trajectories are obtained for any interior feasible point under some mild conditions. In particular, with proper choice of some parameters, the convergence for all three interior point continuous trajectories does not require the strict complementarity or the analyticity of the objective function. These results are new in the literature.
Showing items related by title, author, creator and subject.
Qian, X.; Liao, L.; Sun, Jie; Zhu, H. (2018)The convergence of central paths has been a focal point of research on interior point methods. Quite detailed analyses have been made for the linear case. However, when it comes to the convex case, even if the constraints ...
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 ...
Lommerse, Marina; Smith, Dianne; Beeck, Sarah (2010)Research Background :: The researchers not only curated the exhibition but also were the designers of the installation. Permeable Boundaries. Interiors—a field of possibilities. The design, captured the outcomes of the ...