Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
DOI10.1080/02331934.2018.1477942zbMATH Open1414.90341OpenAlexW2809013870MaRDI QIDQ4559409FDOQ4559409
Authors: Huali Zhao, Hongwei Liu 
Publication date: 3 December 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1477942
Recommendations
- scientific article; zbMATH DE number 5564090
- Complexities of homogeneous algorithm with one norm neighborhood for monotone nonlinear complementarity problems over symmetric cones
- scientific article; zbMATH DE number 1059215
- On a homogeneous algorithm for the monotone complementarity problem
- scientific article; zbMATH DE number 30397
- On the convergence of iterative methods for symmetric linear complementarity problems
- Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems
- On the complexity of a combined homotopy interior method for convex programming
complexitynonlinear complementarity problemsymmetric coneinterior point algorithmhomogeneous algorithm
Convex programming (90C25) Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Title not available (Why is that?)
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On a homogeneous algorithm for the monotone complementarity problem
- On a commutative class of search directions for linear programming over symmetric cones
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
- Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones
Cited In (2)
Uses Software
This page was built for publication: Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559409)
