Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
From MaRDI portal
Publication:2467158
DOI10.1007/S10107-006-0068-2zbMATH Open1156.90026OpenAlexW2022229121MaRDI QIDQ2467158FDOQ2467158
Publication date: 21 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0068-2
Recommendations
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
- Corrector-predictor methods for sufficient linear complementarity problems
- Predictor-corrector Methods for a Class of Linear Complementarity Problems
- A new predicto-corrector method for pseudomonotone nonlinear complementarity problems
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- Wide-neighborhood predictor-corrector algorithm for a class of nonlinear complementarity problem
- A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
Numerical optimization and variational techniques (65K10) Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Newton-type methods (49M15)
Cites Work
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems
- High order long-step methods for solving linear complementarity problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
Cited In (20)
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Interior-point algorithm based on general kernel function for monotone linear complementarity problem
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Title not available (Why is that?)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
- Sufficient weighted complementarity problems
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Further development of multiple centrality correctors for interior point methods
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Perturbed path following predictor-corrector interior point algorithms
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
- Predictor-corrector Methods for a Class of Linear Complementarity Problems
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
This page was built for publication: Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467158)
