Pages that link to "Item:Q2630833"
From MaRDI portal
The following pages link to A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (Q2630833):
Displaying 9 items.
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
- An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (Q1731107) (← links)
- A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization (Q2176832) (← links)
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization (Q2228421) (← links)
- Two wide neighborhood interior-point methods for symmetric cone optimization (Q2401022) (← links)
- A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787) (← links)
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming (Q5058407) (← links)
- An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression (Q6160373) (← links)