scientific article; zbMATH DE number 3625108

From MaRDI portal
Publication:4187574

zbMath0402.90059MaRDI QIDQ4187574

I. I. Dikin

Publication date: 1974


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Superlinear convergence of the affine scaling algorithm, A simple proof of a primal affine scaling method, An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption, A convergence analysis for a convex version of Dikin's algorithm, The primal power affine scaling method, An affine scaling method using a class of differential barrier functions: primal approach, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Matrix-free interior point method, Interior point methods 25 years later, A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms, A primal projective interior point method for linear programming, Global convergence of the affine scaling methods for degenerate linear programming problems, Computational results of an interior point algorithm for large scale linear programming, On the convergence of the affine-scaling algorithm, Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization, A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions, A new family of penalties for augmented Lagrangian methods, Stabilization of Mehrotra's primal-dual algorithm and its implementation, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, Entering into the domain of feasible solutions using interior point method, Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm, Determination of an interior feasible point for a system of linear constraints, Degeneracy in interior point methods for linear programming: A survey, A simplified global convergence proof of the affine scaling algorithm, The affine-scaling direction for linear programming is a limit of projective-scaling directions, On the big \({\mathcal M}\) in the affine scaling algorithm