Pages that link to "Item:Q761967"
From MaRDI portal
The following pages link to A new polynomial-time algorithm for linear programming (Q761967):
Displaying 50 items.
- A strongly polynomial algorithm for linear systems having a binary solution (Q715067) (← links)
- Asymptotic stability of delayed neural networks: a descriptor system approach (Q717415) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- The subset assignment problem for data placement in caches (Q724230) (← links)
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems (Q725814) (← links)
- Quantitative simulations by matrices (Q729815) (← links)
- Barrier function method and correction algorithms for improper convex programming problems (Q735654) (← links)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
- Another look at linear programming for feature selection via methods of regularization (Q746339) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- Two design principles of geometric algorithms in finite-precision arithmetic (Q749243) (← links)
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm (Q750203) (← links)
- Approximating linear programming is log-space complete for P (Q750289) (← links)
- On the asymptotic behavior of the projective rescaling algorithm for linear programming (Q750290) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- Parallel processors for planning under uncertainty (Q751510) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- Solving emission tomography problems on vector machines (Q753694) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
- Capacitated assortment and price optimization under the nested logit model (Q785637) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (Q803714) (← links)
- An interior feasible direction method with constraint projections for linear programming (Q804468) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- An \(\epsilon\)-active barrier-function method for solving minimax problems (Q806678) (← links)
- Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations (Q806959) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- The decomposition principle and algorithms for linear programming (Q806964) (← links)
- Computing projections for the Karmarkar algorithm (Q806966) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Vector forecasting and dynamic portfolio selection: Empirical efficiency of recursive multiperiod strategies (Q807368) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- An optimal algorithm for the multi-item capacitated production planning problem (Q809873) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Data dependent worst case bound improving techniques in zero-one programming (Q811361) (← links)
- Pre-scheduling (Q813142) (← links)
- On detecting nonlinear patterns in discriminant problems (Q819313) (← links)
- Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Asymptotics of the regression quantile basic solution under misspecification. (Q834019) (← links)
