An efficient fifth-order method for linear optimization
From MaRDI portal
Publication:306315
DOI10.1007/s10957-016-0896-zzbMath1346.90570OpenAlexW2287766223MaRDI QIDQ306315
Hicham EL Bouanani, Youssef EL Foutayeni, Mohamed Khaladi
Publication date: 31 August 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0896-z
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient fifth order method for solving systems of nonlinear equations
- Ostrowski type methods for solving systems of nonlinear equations
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- Increasing the convergence order of an iterative method for nonlinear systems
- Interior path following primal-dual algorithms. I: Linear programming
- Geometric constructions of iterative functions to solve nonlinear equations
- Some variant of Newton's method with third-order convergence.
- Third-order methods from quadrature formulae for solving systems of nonlinear equations.
- A modified Newton method with cubic convergence: the multivariate case
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- A fourth-order method from quadrature formulae to solve systems of nonlinear equations
- Variants of Newton's method using fifth-order quadrature formulas
- Some iterative methods for solving a system of nonlinear equations
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
This page was built for publication: An efficient fifth-order method for linear optimization
