A full-Newton step infeasible interior-point algorithm for P_ () linear complementarity problem

DOI10.1007/S11424-014-1273-3MaRDI QIDQ890633zbMATH OpenOpenAlexFDO

Authors Danhua Zhu, Mingwang Zhang

Publication date 10 November 2015

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-014-1273-3

zbMATH Keywords

polynomial complexityinfeasible interior-point method\(P_\ast (\kappa)\) linear complementarity problemsfull-Newton steps

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A full-Newton step infeasible interior-point algorithm for LCPs based on a kernel function
• A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
• A new full-Newton infeasible interior-point algorithm for \(P_*(\kappa)\) linear complementarity problems
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• An infeasible interior-point algorithm for linear complementarity problem based on a kernel function

Cites work

• scientific article; zbMATH DE number 5798339 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A unified approach to interior point algorithms for linear complementary problems
• An asymptotical \(O((k+1)n^3L)\) affine scaling algorithm for the \(P_*(k)\)-matrix linear complementarity problem
• Interior Point Methods for Linear Optimization
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• Self-regular functions and new search directions for linear and semidefinite optimization
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps

Cited in

(21)

• A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
• A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
• A new infeasible interior-point method for linear complementarity problem based on full Newton step
• A new full-Newton infeasible interior-point algorithm for \(P_*(\kappa)\) linear complementarity problems
• scientific article; zbMATH DE number 6913928 (Why is no real title available?)
• A full-Newton step infeasible interior-point algorithm for LCPs based on a kernel function
• scientific article; zbMATH DE number 7366754 (Why is no real title available?)
• A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
• A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
• An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• An infeasible interior-point algorithm for linear complementarity problem based on a kernel function
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem

This page was built for publication: A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem

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