A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization

From MaRDI portal

(Redirected from A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization)

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=A_strongly_sub-feasible_primal-dual_quasi_interior-point_algorithm_for_nonlinear_inequality_constrained_optimization&oldid=63569046"