A wide neighborhood interior-point algorithm with arc-search for P_() linear complementarity problem

DOI10.1016/J.APNUM.2018.11.001zbMATH Open1471.65065OpenAlexW2899715963MaRDI QIDQ1633334FDOQ1633334

Authors: Beibei Yuan, Zhengwei Huang, Mingwang Zhang 

Publication date: 19 December 2018

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2018.11.001

Recommendations

• A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
• An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
• scientific article; zbMATH DE number 1300324

zbMATH Keywords

polynomial complexityarc-searchinterior-point algorithm\(P_\ast(\kappa)\) linear complementarity problem

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

• A polynomial arc-search interior-point algorithm for linear programming
• 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
• Title not available (Why is that?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• On the resolution of monotone complementarity problems
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• Interior Point Methods for Linear Optimization
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• Title not available (Why is that?)
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
• Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
• The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
• Title not available (Why is that?)

Cited In (2)

• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
• A wide-neighborhood path-following algorithm for \(P^*(\tau)\)-matrix linear complementary problems

Uses Software

• CurveLP

This page was built for publication: A wide neighborhood interior-point algorithm with arc-search 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 Q1633334)