scientific article; zbMATH DE number 4197741
From MaRDI portal
Publication:5202840
zbMATH Open0725.90060MaRDI QIDQ5202840FDOQ5202840
Authors: Christoph Witzgall, Paul T. Boggs, Paul D. Domich 
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4197743
- On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming
- On the existence and convergence of the central path for convex programming and some duality results
- Asymptotic Behavior of Continuous Trajectories for Primal-Dual Potential-Reduction Methods
- scientific article; zbMATH DE number 4197742
Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (19)
- Analyticity of the central path at the boundary point in semidefinite programming
- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming
- Two simple proofs for analyticity of the central path in linear programming.
- A simplified global convergence proof of the affine scaling algorithm
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Degeneracy in interior point methods for linear programming: A survey
- Limiting behavior of weighted central paths in linear programming
- On the \(\log\)-exponential trajectory of linear programming
- Traces and Emergence of Nonlinear Programming
- Superlinear convergence of the affine scaling algorithm
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
- Convergence of trajectories in infinite horizon optimization
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- The asymptotic optimal partition and extensions of the nonsubstitution theorem
- Examples of ill-behaved central paths in convex optimization
- Improving the rate of convergence of interior point methods for linear programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
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 Q5202840)
