A predictor-corrector algorithm for P_()-linear complementarity problems based on a specific self-regular proximity function
DOI10.1007/S40306-014-0100-1zbMATH Open1332.90301OpenAlexW1974047843MaRDI QIDQ255679FDOQ255679
Publication date: 9 March 2016
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40306-014-0100-1
Recommendations
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- scientific article; zbMATH DE number 6129935
- A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
- Predictor-corrector Methods for a Class of Linear Complementarity Problems
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
- Corrector-predictor methods for sufficient linear complementarity problems
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
linear complementarity problemspolynomial complexitypredictor-corrector algorithmself-regular functions
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- Self-regular functions and new search directions for linear and semidefinite optimization
- \(P_ *\)-matrices are just sufficient
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- Title not available (Why is that?)
- The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
Cited In (2)
This page was built for publication: A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255679)