scientific article; zbMATH DE number 6913928

zbMATH Open1393.90136MaRDI QIDQ4577944FDOQ4577944

M. Haghighi, Behrouz Kheirfam

Publication date: 6 August 2018

Full work available at URL: https://hrcak.srce.hr/ojs/index.php/crorr/article/view/3605

Title of this publication is not available (Why is that?)

Recommendations

• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• A new search direction for full-Newton step interior-point method in \(P_*(\kappa)\)-HLCP
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
• A full-Newton step infeasible interior-point algorithm for LCPs based on a kernel function
• A new full-Newton infeasible interior-point algorithm for \(P_*(\kappa)\) linear complementarity problems
• Complexity analysis of a weighted-full-Newton step interior-point algorithm for \(P_*(\kappa)\)-LCP
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
• scientific article; zbMATH DE number 7366754

zbMATH Keywords

interior-point methodspolynomial complexityfull-Newton step\(P_\ast(\kappa)\)-linear complementarity problem

Mathematics Subject Classification ID

Interior-point methods (90C51)

Cites Work

• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
• A polynomial path-following interior point algorithm for general linear complementarity problems
• 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
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• New interior point algorithms in linear programming
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• Interior path following primal-dual algorithms. I: Linear programming
• A new primal-dual path-following method for convex quadratic programming
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• An interior point potential reduction algorithm for the linear complementarity problem
• A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization

Cited In (14)

• Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
• Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
• A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
• New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
• Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
• A path-following interior-point algorithm for monotone LCP based on a modified Newton search direction
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
• A new search direction for full-Newton step infeasible interior-point method in linear optimization
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• Title not available (Why is that?)
• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577944)