An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
From MaRDI portal
Publication:2634322
DOI10.1007/s12190-014-0856-4zbMath1330.90133OpenAlexW2062012290MaRDI QIDQ2634322
Publication date: 9 February 2016
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-014-0856-4
kernel functionhorizontal linear complementarity problemcentral pathinfeasible full-Newton step method
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (6)
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- A polynomial interior-point algorithm for monotone linear complementarity problems
- Kernel function based interior-point methods for horizontal linear complementarity problems
- 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 primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
- Self-regular functions and new search directions for linear and semidefinite optimization
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
This page was built for publication: An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
