The following pages link to (Q3804467):
Displaying 23 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
- A Newton-like method for nonlinear system of equations (Q1039287) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function (Q2294231) (← links)
- A potential reduction method for tensor complementarity problems (Q2313741) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035) (← links)
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)
- Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data (Q5090518) (← links)
