A unified approach to interior point algorithms for linear complementarity problems: A summary

From MaRDI portal

Publication:1180826

Jump to:navigation, search

DOI10.1016/0167-6377(91)90010-MzbMath0745.90069OpenAlexW2020305724MaRDI QIDQ1180826

Toshihito Noma, Nimrod Megiddo, Akiko Yoshise, Kojima, Masakazu

Publication date: 27 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90010-m

zbMATH Keywords

linear complementarity interior point algorithms path-following positive semi-definite matrix potential reduction nonsymmetric matrices with nonnegative principal minors

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP, An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, New variants of the criss-cross method for linearly constrained convex quadratic programming, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP, A pathsearch damped Newton method for computing general equilibria, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, An interior point approach for linear complementarity problem using new parametrized kernel function, An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path, On a subclass of \(P_ 0\), An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function, Reducing horizontal linear complementarity problems, On well-structured convex–concave saddle point problems and variational inequalities with monotone operators, Generalized System Identification with Stable Spline Kernels, The Linear Complementarity Problems with a Few Variables per Constraint, The curvature integral and the complexity of linear complementarity problems, Pivoting in linear complementarity: Two polynomial-time cases, A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Estimating shape parameters of piecewise linear-quadratic problems, An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems, Primal-dual target-following algorithms for linear programming, Sign reversing and matrix classes, Interior-point methods for nonlinear complementarity problems, An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming, An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs, A hybrid algorithm for the solution of a single commodity spatial equilibrium model, A predictor-corrector method for extended linear-quadratic programming, 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, Linear optimization over homogeneous matrix cones, Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras, Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term, A Simple P-Matrix Linear Complementarity Problem for Discounted Games, A new class of smoothing functions and a smoothing Newton method for complementarity problems, Computing integral solutions of complementarity problems, Using vector divisions in solving the linear complementarity problem, A full-Newton step interior-point method for monotone weighted linear complementarity problems, A corrector-predictor interior-point method with new search direction for linear optimization, Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions, A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood, A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization, Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems, A path to the Arrow-Debreu competitive market equilibrium, Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path, A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP, Interior-point algorithm based on general kernel function for monotone linear complementarity problem, The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, An efficient algorithm for second-order cone linear complementarity problems, A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems, A smoothing Gauss-Newton method for the generalized HLCP, A corrector-predictor path-following method for convex quadratic symmetric cone optimization, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Sufficient matrices belong to \(L\)., A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, Complementarity problems, A class of polynomially solvable linear complementarity problems, Examples of ill-behaved central paths in convex optimization, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, A survey on conic relaxations of optimal power flow problem, Alternative theorems for nonlinear projection equations and applications to generalized complementarity problems., Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, Unnamed Item, Improving the convergence of non-interior point algorithms for nonlinear complementarity problems, A continuation algorithm for a class of linear complementarity problems using an extrapolation technique, Near boundary behavior of primal-dual potential reduction algorithms for linear programming, On the choice of parameters for power-series interior point algorithms in linear programming, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., The reformulation of nonlinear complementarity problems using the Fischer-Burmeister function, On sufficient properties of sufficient matrices, A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, Iterative descent method for generalized Leontief model, An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step, An interior point potential reduction method for constrained equations, On finite termination of an iterative method for linear complementarity problems, Unique End of Potential Line, A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions, A potential reduction method for tensor complementarity problems, Unnamed Item, Unnamed Item, On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, Enhanced intersection cutting-plane approach for linear complementarity problems, Strict feasibility conditions in nonlinear complementarity problems, Analysis for a homotopy path of complementarity problems based on \(\mu\)-exceptional family, A new class of polynomial primal-dual methods for linear and semidefinite optimization, The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path, On the convergence analysis of arc search interior point methods for LCPs, More on hidden Z-matrices and linear complementarity problem, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, A new second-order corrector interior-point algorithm for P*(k)-LCP, Unnamed Item, Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems, Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, A globally convergent primal-dual interior point algorithm for convex programming, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Global convergence in infeasible-interior-point algorithms, Sufficient weighted complementarity problems, Fast convergence of an inexact interior point method for horizontal complementarity problems, Constant potential primal-dual algorithms: A framework, A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem, Extended \(P\)-pairs, A new path-following algorithm for nonlinear \(P_*\) complementarity problems, Long-step strategies in interior-point primal-dual methods, Fast convergence of the simplified largest step path following algorithm, Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points, The largest step path following algorithm for monotone linear complementarity problems, Criss-cross methods: A fresh view on pivot algorithms, On computer-assisted proofs for solutions of linear complementarity problems, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems, Deriving potential functions via a symmetry principle for nonlinear equations, An inexact interior point method for the large-scale simulation of granular material, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem, A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, Combinatorial characterizations of \(K\)-matrices, Generalized Kalman smoothing: modeling and algorithms, Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality, A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems, Predictor-corrector method for nonlinear complementarity problems, EP theorems and linear complementarity problems, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions, Solvability of Newton equations in smoothing-type algorithms for the SOCCP, A non-interior continuation algorithm for the CP based on a generalized smoothing function, A projected-gradient interior-point algorithm for complementarity problems, Solving discrete systems of nonlinear equations, Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function, A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions, On the complexity of computing the handicap of a sufficient matrix, A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function, On the natural merit function for solving complementarity problems, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, On the use of coordinate-free matrix calculus, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, A generalized direction in interior point method for monotone linear complementarity problems, A unified approach to interior point algorithms for linear complementarity problems: A summary, Enumeration of PLCP-orientations of the 4-cube, The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra, New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP, Parabolic target space and primal-dual interior-point methods, Extension of GAMS for complementarity problems arising in applied economic analysis, Cyclic games and linear programming, Two characterizations of sufficient matrices, Generalizations of the hidden Minkowski property, Determining the handicap of a sufficient matrix, An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term, A utility theory based interactive approach to robustness in linear optimization, A little theorem of the big \({\mathcal M}\) in interior point algorithms, A path-following procedure to find a proper equilibrium of finite games, A long-step barrier method for convex quadratic programming, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, Corrector-predictor methods for sufficient linear complementarity problems, A field guide to the matrix classes found in the literature of the linear complementarity problem, On the solution of NP-hard linear complementarity problems, Interior point algorithm for \(P_*\) nonlinear complementarity problems, The Kantorovich theorem and interior point methods, A new smoothing and regularization Newton method for \(P_{0}\)-NCP, Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix, 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, Column sufficient tensors and tensor complementarity problems, New method for determining search directions for interior-point algorithms in linear optimization, Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions, Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem, An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization, Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function, A discrete multivariate mean value theorem with applications, EP theorem for dual linear complementarity problems, Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP, New characterizations of row sufficient matrices, Sufficiency of linear transformations on Euclidean Jordan algebras, On the long-step path-following method for semidefinite programming, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems, An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-\(P^M_*\)-complementarity problems, On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization, Similarity and other spectral relations for symmetric cones, Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones, Quasi-P\(_*\)-maps, P(\(\tau,\alpha,\beta\))-maps, exceptional family of elements, and complementarity problems, Symmetric primal-dual path-following algorithms for semidefinite programming, On weighted centers for semidefinite programming, Piecewise linear methods for nonlinear equations and optimization, Degeneracy in interior point methods for linear programming: A survey, A primal-dual infeasible-interior-point algorithm for linear programming, Global linear convergence of a path-following algorithm for some monotone variational inequality problems, A primal-dual affine-scaling potential-reduction algorithm for linear programming, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems, A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function

Uses Software

KORBX

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1180826&oldid=12039324"