A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
From MaRDI portal
(Redirected from Publication:464544)
Recommendations
- A full Nesterov-Todd step infeasible-interior-point algorithm for Cartesian \(P_\ast(\kappa)\) horizontal linear complementarity problems over symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- scientific article; zbMATH DE number 6285133
- A full-NT step infeasible interior-point algorithm for mixed symmetric cone LCPs
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Simplified analysis of a full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- An infeasible interior point method for linear complementarity problems over symmetric cones
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
Cited in
(20)- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
- scientific article; zbMATH DE number 6285133 (Why is no real title available?)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- An infeasible full NT-step interior point method for circular optimization
- Simplified analysis of a full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new search direction for full-Newton step infeasible interior-point method in linear optimization
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- A full Nesterov-Todd step infeasible-interior-point algorithm for Cartesian \(P_\ast(\kappa)\) horizontal linear complementarity problems over symmetric cones
- An infeasible full-NT step interior point algorithm for CQSCO
- An improved infeasible interior-point method for symmetric cone linear complementarity problem
- A full-NT step infeasible interior-point algorithm for mixed symmetric cone LCPs
- New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
This page was built for publication: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464544)
