Pages that link to "Item:Q3415567"

The following pages link to A class of polynomial primal-dual interior-point algorithms for semidefinite optimization (Q3415567):

Displaying 10 items.

• A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
• Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (Q1434073) (← links)
• A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
• An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
• Reduction of truss topology optimization (Q3052591) (← links)
• A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions (Q3562408) (← links)
• Penalized interior point approach for constrained nonlinear programming (Q3572651) (← links)
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions (Q4639122) (← links)
• A new primal-dual interior-point algorithm for convex quadratic optimization (Q5320227) (← links)