scientific article; zbMATH DE number 6913928
From MaRDI portal
Publication:4577944
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_ () 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
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (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 feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new primal-dual path-following method for convex quadratic programming
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- An interior point potential reduction algorithm for the linear complementarity problem
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Interior path following primal-dual algorithms. I: Linear programming
- 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
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
Cited in
(16)- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
- A full Nesterov-Todd step primal-dual path-following interior point algorithm for semidefinite linear complementarity problems
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- 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
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- A new search direction for full-Newton step infeasible interior-point method in linear optimization
- 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
- 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
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)
