An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
DOI10.1080/02331934.2013.869877zbMATH Open1337.90083OpenAlexW1986112072MaRDI QIDQ2808306FDOQ2808306
Nezam Mahdavi-Amiri, Behrouz Kheirfam
Publication date: 23 May 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.869877
Recommendations
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- An improved infeasible interior-point method 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
- A new infeasible interior-point algorithm for linear complementarity problem
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Feasibility issues in a primal-dual interior-point method for linear programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- A Jordan-algebraic approach to potential-reduction algorithms
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Polynomiality of infeasible-interior-point algorithms for linear programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Similarity and other spectral relations for symmetric cones
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A generalization of the linear complementarity problem
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
- A class of linear complementarity problems solvable in polynomial time
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
Cited In (4)
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- A full-Newton step infeasible interior point algorithm and its parameters analysis
- An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones
This page was built for publication: An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808306)
