Limiting behavior of the affine scaling continuous trajectories for linear programming problems
From MaRDI portal
Publication:2640436
DOI10.1007/BF01594923zbMath0719.90044MaRDI QIDQ2640436
Renato D. C. Monteiro, Ilan Adler
Publication date: 1991
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
logarithmic barrier; limiting behaviour; primal-dual affine scaling; dual affine scaling; primal affine scaling
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Two simple proofs for analyticity of the central path in linear programming., Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines, Dual convergence of the proximal point method with Bregman distances for linear programming, On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm, The \(\ell_1\) solution of linear inequalities, Global convergence of the affine scaling methods for degenerate linear programming problems, Improving the rate of convergence of interior point methods for linear programming, On the convergence of the affine-scaling algorithm, Todd's low-complexity algorithm is a predictor-corrector path-following method, Condition measures and properties of the central trajectory of a linear program, Degeneracy in interior point methods for linear programming: A survey, A simplified global convergence proof of the affine scaling algorithm, Limiting behavior of weighted central paths in linear programming, The discrete Radon transform and its approximate inversion via linear programming, Trust region affine scaling algorithms for linearly constrained convex and concave programs, The asymptotic optimal partition and extensions of the nonsubstitution theorem, Examples of ill-behaved central paths in convex optimization, An implementation of Karmarkar's algorithm for linear programming, Analyticity of the central path at the boundary point in semidefinite programming, Differential-algebraic approach to linear programming, Some properties of generalized proximal point methods for quadratic and linear programming, An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption, The primal power affine scaling method, Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, Superlinear convergence of the affine scaling algorithm, Shape-preserving approximation of multiscale univariate data by cubic \(L_1\) spline fits, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Shape-preserving, first-derivative-based parametric and nonparametric cubic \(L_{1}\) spline curves, Loss and retention of accuracy in affine scaling methods
Cites Work
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
