A new full-Newton step interior-point method for P_*()-LCP based on a positive-asymptotic kernel function

DOI10.1007/S12190-020-01356-1zbMATH Open1475.90130OpenAlexW3024413612MaRDI QIDQ2053077FDOQ2053077

Authors: Mingwang Zhang, Kun Huang, Mengmeng Li, Yanli Lv 

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01356-1

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 \(P_\ast (\kappa)\) linear complementarity problem
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• scientific article; zbMATH DE number 6913928
• New primal-dual interior point methods for \(P_*(\kappa)\) linear complementarity problems

zbMATH Keywords

full-Newton step\(P_*(\kappa)\)-LCPsIPMspositive-asymptotic kernel function

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Interior-point methods (90C51)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• 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
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A polynomial path-following interior point algorithm for general linear complementarity problems
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• New interior point algorithms in linear programming
• Title not available (Why is that?)
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• Title not available (Why is that?)
• A new primal-dual path-following method for convex quadratic programming
• A full-Newton step interior-point algorithm based on modified Newton direction
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A polynomial method of approximate centers for linear programming
• EP theorem for dual linear complementarity problems
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• A new algorithm for solving self-dual linear optimization problems
• New method for determining search directions for interior-point algorithms in linear optimization
• A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions

Cited In (5)

• Title not available (Why is that?)
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
• A new search direction for full-Newton step interior-point method in \(P_*(\kappa)\)-HLCP
• A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem

This page was built for publication: A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function

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