The following pages link to (Q3067612):
Displaying 6 items.
- An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization (Q2260663) (← links)
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions (Q2316302) (← links)
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)