Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An interior-point algorithm for linear optimization based on a new kernel function

From MaRDI portal
Publication:815161
Jump to:navigation, search

zbMath1152.90522MaRDI QIDQ815161

M. Reza Peyghami, Keyvan Amini

Publication date: 22 February 2006

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)


zbMATH Keywords

interior-point methodlinear optimizationlarge-update methodpolynomial-time complexity


Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)


Related Items

A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:815161&oldid=12754096"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki