A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

zbMATH Open1305.90394MaRDI QIDQ464544FDOQ464544

Behrouz Kheirfam, Nezam Mahdavi-Amiri

Publication date: 27 October 2014

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://bims.iranjournals.ir/article_515_62.html

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

zbMATH Keywords

Euclidean Jordan algebrainterior-point algorithmsmonotone linear complementarity problem

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (13)

• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
• 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 full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• An infeasible full NT-step interior point method for circular optimization
• A new search direction for full-Newton step infeasible interior-point method in linear optimization
• A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood
• Simplified analysis of a full Nesterov–Todd step infeasible interior-point method for symmetric optimization
• An infeasible full-NT step interior point algorithm for CQSCO
• 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
• Title not available (Why is that?)

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)