Superlinear primal-dual affine scaling algorithms for LCP
From MaRDI portal
(Redirected from Publication:1908018)
Recommendations
- A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- On the primal-dual affine scaling method
- A new variant of the primal affine scaling algorithm for linear programs
- Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm
- Generalized affine scaling algorithms for linear programming problems
- Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
- Superlinear convergence of the affine scaling algorithm
- A class of primal affine scaling algorithms
- scientific article; zbMATH DE number 1785846
Cited in
(11)- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- A self-adjusting interior point algorithm for linear complementarity problems
- Constant potential primal-dual algorithms: A framework
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- On the natural merit function for solving complementarity problems
- Controlled dual perturbations for central path trajectories in geometric programming
- A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
- A path-following interior-point algorithm for linear and quadratic problems
- Potential-reduction methods in mathematical programming
This page was built for publication: Superlinear primal-dual affine scaling algorithms for LCP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908018)
