A new and efficient large-update interior-point method for linear optimization
From MaRDI portal
The authors start with an observation that there is still a gap between the practical behavior of interior-point algorithms for linear optimization problems and the theoretical performance results. The aim of the article is to show that, by slightly modifying the classical primal-dual Newton search direction, the complexity of large-update methods can be improved. The result is an \(O\bigl(\sqrt{n}\log n\log (n/\varepsilon)\bigr)\) iteration bound.
Recommendations
- The modified interior point algorithm for linear optimization
- An interior-point algorithm for linear optimization based on a new barrier function
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- An interior-point algorithm for linear optimization based on a new kernel function
Cited in
(50)- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
- On self-regular IPMs (with comments and rejoinder)
- The accuracy of interior-point methods based on kernel functions
- A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- An efficient basis update for asymptotic linear programming
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
- Two aggregate-function-based algorithms for analysis of 3D frictional contact by linear complementarity problem formulation
- Large-update interior point algorithm for P_*-linear complementarity problem
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Infeasible interior-point methods for linear optimization based on large neighborhood
- The modified interior point algorithm for linear optimization
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- scientific article; zbMATH DE number 2143182 (Why is no real title available?)
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- An interior point approach for linear complementarity problem using new parametrized kernel function
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
- scientific article; zbMATH DE number 7551027 (Why is no real title available?)
- Sharper analysis of upper bound for the iteration complexity of an interior-point method using primal-dual full-Newton step algorithm
- Primal-dual entropy-based interior-point algorithms for linear optimization
- A new infeasible interior-point algorithm for linear complementarity problem
- New complexity analysis of the primal-dual Newton method for linear optimization
- Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
- Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
- An efficient bi-parametric hyperbolic kernel function yielding the best known iteration bounds for linear programming
- An interior-point algorithm for LCP based on a parameterized hyperbolic kernel function
- Closing the iteration gap in linear programming with a new kernel function
- An interior-point algorithm for linear optimization based on a new barrier function
- An efficient 2-parameter hyperbolic kernel-function-based interior-point method for linear programming
- An efficient parameterized logarithmic kernel function for linear optimization
- A new parametric kernel function based on p-generalized sigmoid function for the primal-dual interior point method of linear optimization
- An efficient twice parameterized trigonometric kernel function for linear optimization
- A self-adjusting interior point algorithm for linear complementarity problems
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
This page was built for publication: A new and efficient large-update interior-point method for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2773659)
