Pages that link to "Item:Q4025897"
From MaRDI portal
The following pages link to On Finding Primal- and Dual-Optimal Bases (Q4025897):
Displaying 32 items.
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Using fast matrix multiplication to find basic solutions (Q1275090) (← links)
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces (Q1290608) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Descent approaches for quadratic bilevel programming (Q1331096) (← links)
- Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
- Theoretical complexity of grid cover problems used in radar applications (Q1626552) (← links)
- A new efficient primal dual simplex algorithm (Q1868820) (← links)
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers (Q1904702) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- On solving stochastic production planning problems via scenario modelling (Q1919106) (← links)
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods (Q1919814) (← links)
- Modified fictitious play for solving matrix games and linear-programming problems (Q1919970) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem (Q2056746) (← links)
- A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- Balanced matrices (Q2433704) (← links)
- Converging upon basic feasible solutions through Dantzig-Wolfe decomposition (Q2439505) (← links)
- On the uniqueness of optimal strategies in symmetric matrix games (Q2451671) (← links)
- Recovering an optimal LP basis from an optimal dual solution (Q2480056) (← links)
- Measure transformation and efficient quadrature in reduced-dimensional stochastic modeling of coupled problems (Q2952142) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
- LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
- Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization (Q5359499) (← links)
- Experiments with a hybrid interior point/combinatorial approach for network flow problems (Q5436921) (← links)
