Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
From MaRDI portal
Publication:742844
DOI10.1007/S11075-013-9772-1zbMATH Open1300.65042OpenAlexW1977018573MaRDI QIDQ742844FDOQ742844
Authors: M. Reza Peyghami, S. Fathi Hafshejani 
Publication date: 19 September 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-013-9772-1
Recommendations
- An interior-point algorithm for linear optimization based on a new kernel function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
kernel functionlinear optimizationprimal-dual interior-point methodslarge-update methodsworst case iteration complexity
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interior path following primal-dual algorithms. I: Linear programming
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
Cited In (29)
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- A generic kernel function for interior point methods
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- An efficient parameterized logarithmic kernel function for linear optimization
- New method for determining search directions for interior-point algorithms in linear optimization
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
- An efficient parameterized logarithmic kernel function for semidefinite optimization
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
- Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
- An interior-point algorithm for linear optimization based on a new kernel function
- Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
- Dislocation hyperbolic kernel function
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- An efficient twice parameterized trigonometric kernel function for linear optimization
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
- Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
This page was built for publication: Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742844)
