A weighted-path-following method for symmetric cone linear complementarity problems

DOI10.3934/NACO.2014.4.141MaRDI QIDQ478931zbMATH OpenOpenAlexFDO

Authors Behrouz Kheirfam

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

zbMATH Keywords

linear complementarity problempolynomial complexityfull Nesterov-Todd stepweighted-path-following

Mathematics Subject Classification ID

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

Recommendations

• A weighted-path-following method for the linear complementarity problem
• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
• Path-following algorithms for monotone weighted complementarity problems
• A weighted-path-following method for monotone horizontal linear complementarity problem
• scientific article; zbMATH DE number 6847407

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 4183197 (Why is no real title available?)
• A Jordan-algebraic approach to potential-reduction algorithms
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A weighted-path-following method for the linear complementarity problem
• Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
• Barrier Functions in Interior Point Methods
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• New interior point algorithms in linear programming
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Primal-dual target-following algorithms for linear programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Similarity and other spectral relations for symmetric cones

Cited in

(11)

• Path-following algorithms for monotone weighted complementarity problems
• A weighted-path-following method for monotone horizontal linear complementarity problem
• A weighted-path-following method for the linear complementarity problem
• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
• An implementing weighted path-following algorithm for linear complementarity problems
• The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
• scientific article; zbMATH DE number 6847407 (Why is no real title available?)
• General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems.
• A weighted path-following method for linearly constrained convex programming
• A projection and contraction method for symmetric cone complementarity problem
• scientific article; zbMATH DE number 4183197 (Why is no real title available?)

This page was built for publication: A weighted-path-following method for symmetric cone linear complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q478931)