On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

DOI10.1137/0804012zbMath0803.90092OpenAlexW2043868859MaRDI QIDQ4294753

Publication date: 18 May 1994

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0804012

zbMATH Keywords

global convergence linear complementarity interior-point methods $\varepsilon$-complementarity $\varepsilon$-feasibility

Mathematics Subject Classification ID

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

Related Items

Sparse Approximations with Interior Point Methods, An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path, The nonlinear lopsided PSS-like and HSS-like modulus-based matrix splitting iteration methods for horizontal linear complementarity problem, A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems, An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems, A Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones, An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization, A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION, A smoothing Gauss-Newton method for the generalized HLCP, Primal-Dual Interior-Point Methods for Domain-Driven Formulations, A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step, New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization, A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood, Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, Unnamed Item, Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†, LOQO:an interior point code for quadratic programming, An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, Superlinear convergence of infeasible-interior-point methods for linear programming, An infeasible-interior-point algorithm for linear complementarity problems, Polynomiality of infeasible-interior-point algorithms for linear programming, A wide neighborhood infeasible-interior-point method with arc-search for linear programming, A still simpler way of introducing interior-point method for linear programming, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms, A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming, A full-step interior-point algorithm for linear complementarity problem based on a simple function, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems, Generalizations of $\mathbf P_ 0$- and $\mathbf P$-properties; extended vertical and horizontal linear complementarity problems, Reducing horizontal linear complementarity problems, A combined homotopy interior point method for the linear complementarity problem, Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions, Status determination by interior-point methods for convex optimization problems in domain-driven form, Predictor-corrector algorithm for solving $P_ *(\kappa)$-matrix LCP from arbitrary positive starting points, A generalized homogeneous and self-dual algorithm for linear programming, An arc-search ${\mathcal {O}}(nL)$ infeasible-interior-point algorithm for linear programming, Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization, Trajectory-following methods for large-scale degenerate convex quadratic programming, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Linear programming with stochastic elements: An on-line approach, A modified and simplified full Nesterov-Todd step $\mathcal {O}(N)$ infeasible interior-point method for second-order cone optimization, An $\ell_{2}$-neighborhood infeasible interior-point algorithm for linear complementarity problems, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, A characterization of an $n$ by $2n$ ``$Q_0$-matrix, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, An infeasible-interior-point algorithm using projections onto a convex set, 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, Solving real-world linear ordering problems using a primal-dual interior point cutting plane method, An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption, An infeasible-start path-following method for monotone LCPs, A superquadratic infeasible-interior-point method for linear complementarity problems, New infeasible interior-point algorithm based on monomial method, On the extended linear complementarity problem, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A polynomial arc-search interior-point algorithm for linear programming, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils, A numerical study of an infeasible primal-dual path-following algorithm for linear programming, A full-Newton step $O(n)$ infeasible-interior-point algorithm for linear complementarity problems, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, A generalized variant of two-sweep modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, Optimized choice of parameters in interior-point methods for linear programming, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems, Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, Local uniqueness of solutions to the extended linear complementarity problem, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood, Splitting methods for a class of horizontal linear complementarity problems, Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones, Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications, A modified infeasible-interior-point algorithm for linear optimization problems, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming, A predictor-corrector interior-point algorithm for $P_\ast (\kappa )$-horizontal linear complementarity problem, On the convergence of modulus-based matrix splitting methods for horizontal linear complementarity problems in hydrodynamic lubrication, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, Two new predictor-corrector algorithms for second-order cone programming, Convergence of the homotopy path for a full-Newton step infeasible interior-point method, On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems, A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization, A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization, A generalization of irreducibility and diagonal dominance with applications to horizontal and vertical linear complementarity problems, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, Improved full-Newton step $O(nL)$ infeasible interior-point method for linear optimization, An interior point-proximal method of multipliers for convex quadratic programming, The complexity of self-regular proximity based infeasible IPMs, On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of $H_+$-matrices, Polynomial interior-point algorithms for $P_*(\kappa )$ horizontal linear complementarity problem, Modulus-based matrix splitting methods for horizontal linear complementarity problems, A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems, A new full-Newton step $O(n)$ infeasible interior-point algorithm for semidefinite optimization, Simplified infeasible interior-point algorithm for linear optimization based on a simple function, Interior hybrid proximal extragradient methods for the linear monotone complementarity problem, 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, Projection onto a Polyhedron that Exploits Sparsity, An interior point potential reduction method for constrained equations, A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems, Convergence analysis of the inexact infeasible interior-point method for linear optimization, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, A sparse counterpart of Reichel and Gragg's package QRUP, A sign-based linear method for horizontal linear complementarity problems, Interior-point methods, Global convergence enhancement of classical linesearch interior point methods for MCPs, A relaxation two-sweep modulus-based matrix splitting iteration method for horizontal linear complementarity problems, A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION, An improved full-Newton step $O(n)$ infeasible interior-point method for horizontal linear complementarity problem