Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
From MaRDI portal
Publication:2376364
DOI10.1007/s11075-012-9628-0zbMath1332.65075MaRDI QIDQ2376364
Publication date: 21 June 2013
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9628-0
65K05: Numerical mathematical programming methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
Unnamed Item, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP, An infeasible interior point method for the monotone SDLCP based on a transformation of the central path, New method for determining search directions for interior-point algorithms in linear optimization, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, A generalized direction in interior point method for monotone linear complementarity problems, An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function, A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, 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, A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems, An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function, The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones, A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- A new primal-dual path-following method for convex quadratic programming
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementary problems
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- The largest step path following algorithm for monotone linear complementarity problems
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- Self-regular functions and new search directions for linear and semidefinite optimization
- \(P_ *\)-matrices are just sufficient
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Improved infeasible-interior-point algorithm for linear complementarity problerns
- The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Equivaence between different formulations of the linear complementarity promblem
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A smoothing Gauss-Newton method for the generalized HLCP
