A predictor-corrector algorithm for P_()-linear complementarity problems based on a specific self-regular proximity function

DOI10.1007/S40306-014-0100-1MaRDI QIDQ255679zbMATH OpenOpenAlexFDO

Authors Behrouz Kheirfam, K. Ahmadi

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

zbMATH Keywords

linear complementarity problemspolynomial complexitypredictor-corrector algorithmself-regular functions

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Self-regular functions and new search directions for linear and semidefinite optimization
• The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems
• Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
• \(P_ *\)-matrices are just sufficient

Cited in

(5)

• scientific article; zbMATH DE number 6129935 (Why is no real title available?)
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• A new second-order corrector interior-point algorithm for \(P_\ast (\kappa)\)-LCP

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)