A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
A full-Newton step $O(n)$ infeasible-interior-point algorithm for linear complementarity problems
On the complexity of computing the handicap of a sufficient matrix
Determining the handicap of a sufficient matrix
A new full-Newton step $O(n)$ infeasible interior-point algorithm for semidefinite optimization
A new polynomial-time algorithm for linear programming
A full-Newton step infeasible interior-point algorithm for $P_\ast (\kappa)$ linear complementarity problem
A unified approach to interior point algorithms for linear complementarity problems: A summary
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
A path following interior-point method for linear complementarity problems over circular cones
An arc-search ${\mathcal {O}}(nL)$ infeasible-interior-point algorithm for linear programming
An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
Self-regular functions and new search directions for linear and semidefinite optimization
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
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 feasible interior-point algorithm for $P_\ast(\kappa)$-linear complementarity problems
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
An interior-point method for $P_*(\kappa)$-linear complementarity problem based on a trigonometric kernel function
An infeasible interior-point algorithm with full-Newton steps for $P_*(\kappa)$ horizontal linear complementarity problems based on a kernel function
An improved and modified infeasible interior-point method for symmetric optimization
A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
A Linear Complementarity Problem with a P-Matrix
Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function

This page was built for publication: A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem