scientific article; zbMATH DE number 6913928
From MaRDI portal
Publication:4577944
zbMath1393.90136MaRDI QIDQ4577944
Publication date: 6 August 2018
Full work available at URL: https://hrcak.srce.hr/ojs/index.php/crorr/article/view/3605
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
interior-point methodspolynomial complexityfull-Newton step\(P_\ast(\kappa)\)-linear complementarity problem
Related Items (7)
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ 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 ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A new primal-dual path-following method for convex quadratic programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Interior path following primal-dual algorithms. I: Linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An interior point potential reduction algorithm for the linear complementarity problem
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Complexity analysis of a full-{N}ewton step interior-point method for 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 full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
This page was built for publication:
