Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones

From MaRDI portal
Publication:650213

DOI10.1007/s10957-011-9848-9zbMath1250.90097OpenAlexW2122341846MaRDI QIDQ650213

Goran Lešaja, Cornelis Roos

Publication date: 25 November 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:1dbbd326-ef95-4435-9cf1-d15f87defdae



Related Items

Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones, A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, A method for weighted projections to the positive definite cone, A Lipschitzian error bound for monotone symmetric cone linear complementarity problem, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, Derivatives of eigenvalues and Jordan frames, Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones, On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, A weighted-path-following method for symmetric cone linear complementarity problems, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones, Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones



Cites Work