Pages that link to "Item:Q5147630"
From MaRDI portal
The following pages link to A new full-NT step interior-point method for circular cone optimization (Q5147630):
Displaying 7 items.
- A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
- A path following interior-point method for linear complementarity problems over circular cones (Q1630229) (← links)
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization (Q2353476) (← links)
- An infeasible full NT-step interior point method for circular optimization (Q2360232) (← links)
- Interior-point algorithm for linear programming based on a new descent direction (Q6140958) (← links)
- A dual method for polar cuts in disjoint bilinear programming (Q6546113) (← links)
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization (Q6584764) (← links)