scientific article; zbMATH DE number 5606390

MaRDI QIDQ3397676zbMATH OpenFDO

Authors Adrian Vancea

Publication date 22 September 2009

zbMATH Keywords

polynomial complexitysuperlinear convergence

Mathematics Subject Classification ID

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

Recommendations

• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
• A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
• A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
• A predictor-corrector infeasible-interior-point algorithm for linear programming
• An Infeasible-Interior-Point Method for Linear Complementarity Problems
• Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path

Cited in

(9)

• Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
• scientific article; zbMATH DE number 1054759 (Why is no real title available?)
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• Corrector-predictor methods for sufficient linear complementarity problems
• Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
• An infeasible interior point method for linear complementarity problems over symmetric cones

This page was built for publication:

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