scientific article; zbMATH DE number 3625108

zbMATH Open0402.90059MaRDI QIDQ4187574FDOQ4187574

Authors: I. I. Dikin 

Publication date: 1974

Title of this publication is not available (Why is that?)

zbMATH Keywords

AlgorithmLinear ProgrammingConvergence AnalysisInterior Point

Mathematics Subject Classification ID

Linear programming (90C05) Rate of convergence, degree of approximation (41A25)

Cited In (26)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187574)