Pages that link to "Item:Q1644574"

The following pages link to A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574):

Displaying 7 items.

• An interior-point algorithm for semidefinite least-squares problems. (Q2148405) (← links)
• A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization (Q2176832) (← links)
• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)
• Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function (Q3177630) (← links)
• (Q4622764) (← links)
• A class of new search directions for full-NT step feasible interior point method in semidefinite optimization (Q6186557) (← links)