Complexity of large-update interior point algorithm for P_*( ) linear complementarity problems
DOI10.1016/J.CAMWA.2006.12.004zbMATH Open1135.90410OpenAlexW1985152446MaRDI QIDQ2458697FDOQ2458697
Authors: Yanyan Li 
Publication date: 2 November 2007
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2006.12.004
Recommendations
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- New primal-dual interior point methods for \(P_*(\kappa)\) linear complementarity problems
- A large-update interior point algorithm for \(P_*(\kappa)\) LCP based on a new kernel function
- Complexity analysis of IPM for \(P_*(\kappa)\) LCPS based on eligible kernel functions
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
complexitylinear complementarity problempolynomial algorithmprimal-dual interior point methodKernel functionlarge-update
Numerical optimization and variational techniques (65K10) 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 unified approach to interior point algorithms for linear complementarity problems: A summary
- Self-regular functions and new search directions for linear and semidefinite optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- A self-adjusting interior point algorithm for linear complementarity problems
- An interior-point algorithm for linear optimization based on a new kernel function
- The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem
- Log-barrier method for two-stage quadratic stochastic programming
Cited In (19)
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem
- A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems
- Interior point algorithm for \(P_*\) nonlinear complementarity problems
- NEW COMPLEXITY ANALYSIS OF PRIMAL-DUAL IMPS FOR P*LAPS BASED ON LARGE UPDATES
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- Sufficient weighted complementarity problems
- Using vector divisions in solving the linear complementarity problem
- Complexity of a large-update interior-point algorithm for \(P_*(\kappa)\) linear complementarity problem
- A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
- A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Complexity analysis of IPM for \(P_*(\kappa)\) LCPS based on eligible kernel functions
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- New primal-dual interior point methods for \(P_*(\kappa)\) linear complementarity problems
- The effect of the step-size on the numerical behavior of a primal-dual interior-point algorithm applied to \(P_*(\kappa)\)-linear complementary problem
- A large-update interior point algorithm for \(P_*(\kappa)\) LCP based on a new kernel function
This page was built for publication: Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458697)
