On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
From MaRDI portal
Publication:1319022
DOI10.1007/BF01585182zbMath0799.90111MaRDI QIDQ1319022
Publication date: 12 April 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
superlinear convergencepredictor-corrector algorithmmonotone linear complementarity problempolynomial-time interior-point algorithms
Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Local convergence of interior-point algorithms for degenerate monotone LCP, Global convergence in infeasible-interior-point algorithms, An infeasible-interior-point algorithm for linear complementarity problems, A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization, Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence, A combined homotopy interior point method for the linear complementarity problem, A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming, Fast convergence of the simplified largest step path following algorithm, A corrector–predictor path-following algorithm for semidefinite optimization, The largest step path following algorithm for monotone linear complementarity problems, A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem, Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence, A path-following interior-point algorithm for linear and quadratic problems, A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence, A superquadratic infeasible-interior-point method for linear complementarity problems, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms, Predictor-corrector method for nonlinear complementarity problems, An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, Newton-type methods for solving quasi-complementarity problems via sign-based equation, Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*, Mehrotra-type predictor-corrector algorithm revisited, Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory, The sign-based methods for solving a class of nonlinear complementarity problems, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, Corrector-predictor methods for sufficient linear complementarity problems, On self-regular IPMs (with comments and rejoinder), Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem, A polynomial path-following interior point algorithm for general linear complementarity problems, Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path, Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization, Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions, A non-modulus linear method for solving the linear complementarity problem, A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP, Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems, An interior point potential reduction method for constrained equations, Une procédure de purification pour les problèmes de complémentarité linéaire, monotones, On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems, The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems, An interior point parameterized central path following algorithm for linearly constrained convex programming, A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
Cites Work
- Convergence behavior of interior-point algorithms
- A polynomial Newton method for linear programming
- A multiplicative barrier function method for linear programming
- On Q-order and R-order of convergence
- A polynomial-time algorithm for a class of linear complementarity problems
- Karmarkar's linear programming algorithm and Newton's method
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Quadratic Convergence in a Primal-Dual Method
- Local Convergence Properties of New Methods in Linear Programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
