The following pages link to (Q4187574):
Displayed 26 items.
- Matrix-free interior point method (Q429480) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions (Q688916) (← links)
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm (Q750203) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- 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 (Q930345) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- Global convergence of the affine scaling methods for degenerate linear programming problems (Q1181905) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Determination of an interior feasible point for a system of linear constraints (Q1280896) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- A simplified global convergence proof of the affine scaling algorithm (Q1312779) (← links)
- On the big \({\mathcal M}\) in the affine scaling algorithm (Q1321664) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- A simple proof of a primal affine scaling method (Q1915916) (← links)
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption (Q1915917) (← links)
- A convergence analysis for a convex version of Dikin's algorithm (Q1915918) (← links)
- The primal power affine scaling method (Q1915919) (← links)
- Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization (Q2250064) (← links)
- Entering into the domain of feasible solutions using interior point method (Q2290313) (← links)
- Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
- A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
- An affine scaling method using a class of differential barrier functions: primal approach (Q5085230) (← links)