Pages that link to "Item:Q3057532"
From MaRDI portal
The following pages link to A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532):
Displaying 5 items.
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization (Q2016468) (← links)
- A method for weighted projections to the positive definite cone (Q3453401) (← links)
