A unified approach to interior point algorithms for linear complementary problems
From MaRDI portal
Publication:1202150
DOI10.1007/3-540-54509-3zbMath0766.90077OpenAlexW1570961610MaRDI QIDQ1202150
Nimrod Megiddo, Akiko Yoshise, Toshihito Noma, Kojima, Masakazu
Publication date: 23 January 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-54509-3
linear complementaritydamped Newton methodpathfollwing methodspolynomial-time convergence resultsunified interior point method
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP, A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function, A full-step interior-point algorithm for linear complementarity problem based on a simple function, Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems, Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems, A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs, THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS, A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions, On semimonotone star matrices and linear complementarity problem, A polynomial interior-point algorithm for monotone linear complementarity problems, A new approach to continuation methods for complementarity problems with uniform \(P\)-functions, A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem, A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems, An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity, Unique end of potential line, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones, On Dynamic Multi‐Rigid‐Body Contact Problems with Coulomb Friction, On Dynamic Multi‐Rigid‐Body Contact Problems with Coulomb Friction, A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs, 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, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Kernel-function Based Primal-Dual Algorithms forP*(κ) Linear Complementarity Problems, A representation of the solution set of a class of linear complementarity problems, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function, An adaptive infeasible interior-point algorithm for linear complementarity problems, On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones, A smoothing method for second order cone complementarity problem, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity, Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones, Weakening convergence conditions of a potential reduction method for tensor complementarity problems, On the convergence analysis of arc search interior point methods for LCPs, A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints, The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem, Large-update interior point algorithm for \(P_*\)-linear complementarity problem
