An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
From MaRDI portal
Publication:5470200
DOI10.1137/040604492zbMath1122.90078OpenAlexW2079466664MaRDI QIDQ5470200
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040604492
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (75)
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood ⋮ An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem ⋮ Sufficient weighted complementarity problems ⋮ An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization ⋮ A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming ⋮ A wide neighborhood infeasible-interior-point method with arc-search for linear programming ⋮ A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood ⋮ A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions ⋮ A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization ⋮ A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming ⋮ A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming ⋮ A polynomial interior-point algorithm for monotone linear complementarity problems ⋮ An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems ⋮ Two wide neighborhood interior-point methods for symmetric cone optimization ⋮ A new infeasible-interior-point algorithm for linear programming over symmetric cones ⋮ An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs ⋮ Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem ⋮ A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization ⋮ A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming ⋮ A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ A new second-order corrector interior-point algorithm for semidefinite programming ⋮ 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 ⋮ A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization ⋮ A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood ⋮ Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood ⋮ A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization ⋮ A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs ⋮ 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 ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP ⋮ An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization ⋮ A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function ⋮ A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem ⋮ Interior-point algorithm based on general kernel function for monotone linear complementarity problem ⋮ A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming ⋮ Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem ⋮ Self-Regular Interior-Point Methods for Semidefinite Optimization ⋮ An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones ⋮ An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood ⋮ A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization ⋮ A wide neighborhood interior-point algorithm based on the trigonometric kernel function ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity ⋮ A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization ⋮ New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming ⋮ A new second-order corrector interior-point algorithm for P*(k)-LCP ⋮ Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
This page was built for publication: An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
