A weighted-path-following method for symmetric cone linear complementarity problems
From MaRDI portal
Publication:478931
DOI10.3934/naco.2014.4.141zbMath1304.90204OpenAlexW2333169060MaRDI QIDQ478931
Publication date: 5 December 2014
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2014.4.141
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Cites Work
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- 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
- Primal-dual target-following algorithms for linear programming
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
