An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term

From MaRDI portal

(Redirected from An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_efficient_primal-dual_interior_point_method_for_linear_programming_problems_based_on_a_new_kernel_function_with_a_trigonometric_barrier_term&oldid=60912822"