An Interior-Point Algorithm for Linearly Constrained Optimization

From MaRDI portal

Revision as of 23:20, 29 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4018838

Jump to:navigation, search

DOI10.1137/0802023zbMath0755.65063OpenAlexW2038703898MaRDI QIDQ4018838

Stephen J. Wright

Publication date: 16 January 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/26e5001cd129e85ffc72e5b86e6cc913828cfbad

zbMATH Keywords

global convergence quadratic convergence scaling linear constraints gradient projection algorithm interior point algorithm potential reduction algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

On the formulation and theory of the Newton interior-point method for nonlinear programming ⋮ A quadratically convergent scaling newton’s method for nonlinear programming problems ⋮ A potential reduction algorithm for linearly constrained convex programming

This page was built for publication: An Interior-Point Algorithm for Linearly Constrained Optimization

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4018838&oldid=11987796"