Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗-Reference-Cited by-同舟云学术

Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗

Published:1998-01 Issue:4 Volume:9 Page:245-268
ISSN:1055-6788
Container-title:Optimization Methods and Software
language:en
Short-container-title:Optimization Methods and Software

Author:

Tseng Paul

Publisher

Informa UK Limited

Subject

Applied Mathematics,Control and Optimization,Software

Link

http://www.tandfonline.com/doi/pdf/10.1080/10556789808805695

Reference41 articles.

1. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

2. Alizadeh, F., Haeberly, J.P.A. and Overton, M.L. Primal-dual interior point methods for semidefinite programming. Presented at the Math Programming Symposium. Ann Arbor. Manuscript

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum Interior Point Methods for Semidefinite Optimization;Quantum;2023-09-11

2. Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence;Computational Optimization and Applications;2019-05-22

3. A path following interior-point method for linear complementarity problems over circular cones;Japan Journal of Industrial and Applied Mathematics;2018-06-18

4. Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function;Optimization;2018-04-23

5. A full Nesterov-Todd step primal-dual path-following interior-point algorithm for semidefinite linear complementarity problems;Croatian Operational Research Review;2018