Pages that link to "Item:Q656447"
From MaRDI portal
The following pages link to A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization (Q656447):
Displayed 9 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 corrector-predictor path-following method for convex quadratic symmetric cone optimization (Q2260663) (← links)
- An inexact modified Newton method for VISCC and application in grasping force (Q2274183) (← 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)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
- Corrector-predictor interior-point method with new search direction for semidefinite optimization (Q6159295) (← links)