An efficient fifth-order method for linear optimization
DOI10.1007/S10957-016-0896-ZzbMATH Open1346.90570OpenAlexW2287766223MaRDI QIDQ306315FDOQ306315
Authors: Youssef EL Foutayeni, Hicham EL Bouanani, 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
Recommendations
- An efficient Newton-type method with fifth-order convergence for solving nonlinear equations
- An efficient computational method for linear fifth-order two-point boundary value problems
- A fifth-order iterative method for solving nonlinear equations
- An efficient fifth order method for solving systems of nonlinear equations
- A fifth order iterative method for solving nonlinear equations
Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- Variants of Newton's method using fifth-order quadrature formulas
- Geometric constructions of iterative functions to solve nonlinear equations
- Some iterative methods for solving a system of nonlinear equations
- Title not available (Why is that?)
- Third-order methods from quadrature formulae for solving systems of nonlinear equations.
- A modified Newton method with cubic convergence: the multivariate case
- A fourth-order method from quadrature formulae to solve systems of nonlinear equations
- Ostrowski type methods for solving systems of nonlinear equations
- Increasing the convergence order of an iterative method for nonlinear systems
- Some variant of Newton's method with third-order convergence.
- Interior path following primal-dual algorithms. I: Linear programming
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- An efficient fifth order method 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
This page was built for publication: An efficient fifth-order method for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306315)
