Pages that link to "Item:Q378264"
From MaRDI portal
The following pages link to A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264):
Displayed 13 items.
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
- A primal-dual interior-point method for optimal grasping manipulation of multi-fingered hand-arm robots (Q1706679) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization (Q2353476) (← links)
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones (Q2361596) (← links)
- Two wide neighborhood interior-point methods for symmetric cone optimization (Q2401022) (← links)
- A full Nesterov–Todd step infeasible-interior-point algorithm for Cartesian<i>P</i><sub>*</sub>(κ) horizontal linear complementarity problems over symmetric cones (Q2790893) (← links)
- A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization (Q2795090) (← links)
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function (Q2817226) (← links)
- A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← links)