An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones

DOI10.3846/mma.2018.001zbMath1488.90211OpenAlexW2788376296MaRDI QIDQ4959371

Maryam Zangiabadi, Mohammad Pirhaji, Hossein Mansouri, Saman Hassanzadeh Amin

Publication date: 13 September 2021

Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3846/mma.2018.001

zbMATH Keywords

linear complementarity probleminterior-point methodspolynomial complexitysymmetric coneellipsoidal approximation

Mathematics Subject Classification ID

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

Related Items (2)

A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ Stochastic numerical investigations for nonlinear three-species food chain system

Cites Work

• Unnamed Item
• Unnamed Item
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A polynomial arc-search interior-point algorithm for linear programming
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• A new polynomial-time algorithm for linear programming
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Geometric means on symmetric cones
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
• New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
• A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
• An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
• A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• Numerical Methods for Quasi‐Linear Elliptic Equations with Nonlinear Boundary Conditions

This page was built for publication: An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones