scientific article; zbMATH DE number 6847407

DOI10.4134/CKMS.c160133zbMath1390.90539MaRDI QIDQ4604968

Mohammad Pirhaji, Maryam Zangiabadi, Hossein Mansouri

Publication date: 6 March 2018

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear complementarity problemspolynomial complexitypath following algorithmthe Cartesian property

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial interior-point algorithm for monotone linear complementarity problems
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• A new primal-dual path-following method for convex quadratic programming
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Similarity and other spectral relations for symmetric cones
• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
• A Jordan-algebraic approach to potential-reduction algorithms