Identifying an optimal basis in linear programming.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 565, doi. 10.1007/BF02206830
- By:
- Publication type:
- Article
Works matching IS 02545330 AND DT 1996 AND VI 62 AND IP 1-4
Results: 23
1
2
New complexity results for the Iri-Imai method.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 539, doi. 10.1007/BF02206829
- By:
- Publication type:
- Article
3
Large step volumetric potential reduction algorithms for linear programming.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 521, doi. 10.1007/BF02206828
- By:
- Publication type:
- Article
4
The Newton modified barrier method for QP problems.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 465, doi. 10.1007/BF02206827
- By:
- Publication type:
- Article
5
Computational experience with penalty-barrier methods for nonlinear programming.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 439, doi. 10.1007/BF02206826
- By:
- Publication type:
- Article
6
An ulterior point method for general large-scale quadratic programming problems.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 419, doi. 10.1007/BF02206825
- By:
- Publication type:
- Article
7
The primal power affine scaling method.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 375, doi. 10.1007/BF02206824
- By:
- Publication type:
- Article
8
A convergence analysis for a convex version of Dikin's algorithm.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 357, doi. 10.1007/BF02206823
- By:
- Publication type:
- Article
9
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 325, doi. 10.1007/BF02206822
- By:
- Publication type:
- Article
10
A simple proof of a primal affine scaling method.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 303, doi. 10.1007/BF02206821
- By:
- Publication type:
- Article
11
An interior-point method for semi-infinite programming problems.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 277
- By:
- Publication type:
- Article
12
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 253, doi. 10.1007/BF02206819
- By:
- Publication type:
- Article
13
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 233, doi. 10.1007/BF02206818
- By:
- Publication type:
- Article
14
Primal-dual target-following algorithms for linear programming.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 197, doi. 10.1007/BF02206817
- By:
- Publication type:
- Article
15
A relaxed primal-dual path-following algorithm for Linear programming.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 173, doi. 10.1007/BF02206816
- By:
- Publication type:
- Article
16
A simplified homogeneous and self-dual linear programming algorithm and its implementation.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 151, doi. 10.1007/BF02206815
- By:
- Publication type:
- Article
17
A Mehrotra-type predictor-corrector algorithm with polynomiality and Q-subquadratic convergence.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 131, doi. 10.1007/BF02206814
- By:
- Publication type:
- Article
18
A path-following interior-point algorithm for linear and quadratic problems.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 103, doi. 10.1007/BF02206813
- By:
- Publication type:
- Article
19
An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 81, doi. 10.1007/BF02206812
- By:
- Publication type:
- Article
20
An infeasible-interior-point algorithm using projections onto a convex set.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 59, doi. 10.1007/BF02206811
- By:
- Publication type:
- Article
21
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 29, doi. 10.1007/BF02206810
- By:
- Publication type:
- Article
22
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 1, doi. 10.1007/BF02206809
- By:
- Publication type:
- Article
23
Preface.
- Published in:
- Annals of Operations Research, 1996, v. 62, n. 1-4, p. 1, doi. 10.1007/BF02206808
- By:
- Publication type:
- Article