scientific article
From MaRDI portal
Publication:3033554
zbMath0691.90053MaRDI QIDQ3033554
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Newton-Raphson iterationapproximated Hessian matricespenalty multiplierpolynomial type algorithmspredictor-corrector homotopy algorithmshort-step penalty function
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Newton-type methods (49M15) Linear programming (90C05)
Related Items
A globally convergent primal-dual interior point algorithm for convex programming, Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem, Primal-dual algorithms for linear programming based on the logarithmic barrier method, Long-step strategies in interior-point primal-dual methods, Simultaneous perception-action design via invariant finite belief sets, A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming, IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga, Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis, PageRank optimization by edge selection, Complexity analysis of a linear complementarity algorithm based on a Lyapunov function, On the convergence of the affine-scaling algorithm, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, An active-set strategy in an interior point method for linear programming, A scaling technique for finding the weighted analytic center of a polytope, On the finite convergence of interior-point algorithms for linear programming, Convergence behavior of interior-point algorithms, Near boundary behavior of primal-dual potential reduction algorithms for linear programming, Exploiting special structure in a primal-dual path-following algorithm, An interior point potential reduction method for constrained equations, An interior point method, based on rank-1 updates, for linear programming, An exterior point polynomial-time algorithm for convex quadratic programming, An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs, A quadratically convergent method for linear programming, Finding an interior point in the optimal face of linear programs
