Corrector-predictor methods for sufficient linear complementarity problems
From MaRDI portal
Publication:538303
DOI10.1007/s10589-009-9263-4zbMath1242.90260MaRDI QIDQ538303
Florian A. Potra, Filiz Gurtuna, Olena Shevchenko, Adrian Vancea, Cosmin G. Petra
Publication date: 25 May 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9263-4
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, A new second-order corrector interior-point algorithm for P*(k)-LCP, Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP, A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP, An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem, Sufficient weighted complementarity problems, A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function, A polynomial interior-point algorithm for monotone linear complementarity problems, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems, A smoothing Newton method with a mixed line search for monotone weighted complementarity problems, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, A full-Newton step interior-point method for monotone weighted linear complementarity problems, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem, A corrector-predictor path-following method for convex quadratic symmetric cone optimization, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems, Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems, A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems, A homotopy method for solving the horizontal linear complementarity problem, An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function, A new corrector-predictor interior-point method for symmetric cone optimization, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, A corrector–predictor path-following algorithm for semidefinite optimization, A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones
Cites Work
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- The curvature integral and the complexity of linear complementarity problems
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- \(P_ *\)-matrices are just sufficient
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- Quadratic Convergence in a Primal-Dual Method
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Equivaence between different formulations of the linear complementarity promblem
- On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems
- 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
- High order long-step methods for solving linear complementarity problems
