The following pages link to PDNET (Q16920):
Displayed 39 items.
- Sparsity preserving preconditioners for linear systems in interior-point methods (Q493682) (← links)
- A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← links)
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- Accelerated multigrid for graph Laplacian operators (Q670780) (← links)
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems (Q895654) (← links)
- Inexact interior-point method (Q1384053) (← links)
- Semidefinite programming relaxations for the quadratic assignment problem (Q1386486) (← links)
- Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. (Q1572663) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Convergence analysis of an inexact infeasible interior point method for semidefinite programming (Q1771220) (← links)
- A study of preconditioners for network interior point methods (Q1868386) (← links)
- The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
- A hybrid algorithm for the solution of a single commodity spatial equilibrium model (Q1919772) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- A fast first-order optimization approach to elastoplastic analysis of skeletal structures (Q2358083) (← links)
- Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035) (← links)
- Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs (Q2757582) (← links)
- Spectral Analysis of (Sequences of) Graph Matrices (Q2784350) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- Solving scalarized multi-objective network flow problems using an interior point method (Q3002548) (← links)
- (Q3125523) (← links)
- Combinatorial Preconditioners for Scalar Elliptic Finite-Element Problems (Q3561179) (← links)
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods (Q3562405) (← links)
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (Q3603659) (← links)
- (Q4355915) (← links)
- Perturbed path following predictor-corrector interior point algorithms (Q4504781) (← links)
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows (Q4509740) (← links)
- New Preconditioners for KKT Systems of Network Flow Problems (Q4651974) (← links)
- Final iterations in interior point methods – preconditioned conjugate gradients and modified search directions (Q4945096) (← links)
- (Q4953319) (← links)
- (Q5158552) (← links)
- (Q5294040) (← links)
- Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method (Q5317516) (← links)
- Experiments with a hybrid interior point/combinatorial approach for network flow problems (Q5436921) (← links)
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming (Q5470255) (← links)
- Large-Scale Scientific Computing (Q5898250) (← links)
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming (Q5934414) (← links)