A path-following full Newton-step infeasible interior-point algorithm for P_*()-HLCPs based on a kernel function
From MaRDI portal
(Redirected from Publication:290328)
A path-following full Newton-step infeasible interior-point algorithm for \(P *(\kappa)\)-HLCPs based on a kernel function
A path-following full Newton-step infeasible interior-point algorithm for \(P *(\kappa)\)-HLCPs based on a kernel function
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_ () linear complementarity problem
- scientific article; zbMATH DE number 6913928
- A new full-Newton infeasible interior-point algorithm for \(P_*(\kappa)\) linear complementarity problems
Cites work
- scientific article; zbMATH DE number 1559422 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
- A full-Newton step infeasible-interior-point algorithm for \(P*(\kappa)\)-horizontal linear complementarity problems
- A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A new polynomial-time algorithm for linear programming
- A smoothing Gauss-Newton method for the generalized HLCP
- A unified approach to interior point algorithms for linear complementary problems
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- Corrector-predictor methods for sufficient 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
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- New interior point algorithms in linear programming
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
Cited in
(2)- An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
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)
