Predictor-corrector algorithm for solving P_ *()-matrix LCP from arbitrary positive starting points
From MaRDI portal
(Redirected from Publication:1361112)
Predictor-corrector algorithm for solving \(P *(\kappa)\)-matrix LCP from arbitrary positive starting points
Predictor-corrector algorithm for solving \(P *(\kappa)\)-matrix LCP from arbitrary positive starting points
Recommendations
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
Cites work
- A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A superquadratic infeasible-interior-point method for linear complementarity problems
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- An infeasible-interior-point algorithm for linear complementarity problems
- Local convergence of interior-point algorithms for degenerate monotone LCP
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
Cited in
(33)- Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones
- Two interior-point methods for nonlinear P_*()-complementarity problems.
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- scientific article; zbMATH DE number 6913928 (Why is no real title available?)
- New method for determining search directions for interior-point algorithms in linear optimization
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Finding special points using matrix-free predictor-corrector methods
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A full-Newton step infeasible interior-point algorithm for P_ () linear complementarity problem
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem
- Quasi-P\(_*\)-maps, P(\(\tau,\alpha,\beta\))-maps, exceptional family of elements, and complementarity problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- A corrector-predictor interior-point method with new search direction for linear optimization
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
- Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
This page was built for publication: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361112)
