The following pages link to (Q3491304):
Displaying 50 items.
- Feasible direction interior-point technique for nonlinear optimization (Q1273166) (← links)
- Long-step primal path-following algorithm for monotone variational inequality problems (Q1275718) (← links)
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming (Q1290605) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- A multiobjective interior primal-dual linear programming algorithm (Q1318462) (← links)
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176) (← links)
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337) (← links)
- Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
- On the big \({\mathcal M}\) in the affine scaling algorithm (Q1321664) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Rank-one techniques in log-barrier function methods for linear programming (Q1333365) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
- A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization (Q1363416) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
- An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points (Q1373875) (← links)
- A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
- An extension of predictor-corrector algorithm to a class of convex separable program (Q1375337) (← links)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
- On weighted centers for semidefinite programming (Q1584796) (← links)
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- Polynomial affine algorithms for linear programming (Q1814590) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
- On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method (Q1816897) (← links)
- A simple complexity proof for a polynomial-time linear programming algorithm (Q1824548) (← links)
- Differential-algebraic approach to linear programming (Q1862190) (← links)
- Primal-dual Newton-type interior-point method for topology optimization (Q1862194) (← links)
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming (Q1894948) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- The implementation of linear programming algorithms based on homotopies (Q1911465) (← links)
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
