Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
From MaRDI portal
Publication:432785
DOI10.1016/j.cam.2011.05.036zbMath1242.90292OpenAlexW2078688491MaRDI QIDQ432785
Publication date: 4 July 2012
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.05.036
Related Items
A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds, An efficient fifth-order method for linear optimization, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function, Kernel function based interior-point methods for horizontal linear complementarity problems, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, Interior-point algorithm for linear programming based on a new descent direction, Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function, An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization, Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term, An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term, A generic kernel function for interior point methods, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, Unnamed Item, An efficient parameterized logarithmic kernel function for semidefinite optimization, Interior-point algorithm for linear optimization based on a new trigonometric kernel function, An efficient parameterized logarithmic kernel function for linear optimization, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions, Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function, A wide neighborhood interior-point algorithm based on the trigonometric kernel function, An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity 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, Relaxing high-dimensional constraints in the direct solution space method for early phase development, An efficient twice parameterized trigonometric kernel function for linear optimization, A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- Interior path following primal-dual algorithms. I: Linear programming
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- Path-Following Methods for Linear Programming
- 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
