A path-following full Newton-step infeasible interior-point algorithm for P_*()-HLCPs based on a kernel function
DOI10.1007/S40305-015-0113-ZzbMATH Open1338.90404OpenAlexW2285421266MaRDI QIDQ290328FDOQ290328
H. Mansouri, M. Zangiabadi, Soodabeh Asadi
Publication date: 1 June 2016
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-015-0113-z
Recommendations
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- A full-Newton step infeasible interior-point algorithm for LCPs based on a kernel function
- A new search direction for full-Newton step interior-point method in \(P_*(\kappa)\)-HLCP
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
- A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
- A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
- scientific article; zbMATH DE number 6913928
- A new full-Newton infeasible interior-point algorithm for \(P_*(\kappa)\) linear complementarity problems
horizontal linear complementarity probleminfeasible interior-point methodkernel functioncentral path
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementary problems
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Corrector-predictor methods for sufficient linear complementarity problems
- Title not available (Why is that?)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Title not available (Why is that?)
- A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- New interior point algorithms in linear programming
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A smoothing Gauss-Newton method for the generalized HLCP
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
Cited In (2)
This page was built for publication: A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290328)
