Pages that link to "Item:Q2841915"

The following pages link to Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915):

Displaying 7 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 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)
• An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems (Q2696960) (← links)
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)