Pages that link to "Item:Q5571340"

The following pages link to The simplex method of linear programming using LU decomposition (Q5571340):

Displaying 48 items.

• qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
• A quasi-Newton method with modification of one column per iteration (Q798571) (← links)
• Personal report : Gene Howard Golub, 1932--2007 (Q924313) (← links)
• An efficient approach to updating simplex multipliers in the simplex algorithm (Q927163) (← links)
• On solution of multicoupled models (Q1088906) (← links)
• An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems (Q1107277) (← links)
• The simplex method is not always well behaved (Q1109528) (← links)
• Number of operations for updating the elimination form of the basis- inverse of the revised simplex-algorithm (Q1244166) (← links)
• Optimization with staircase structure: An application to generation scheduling (Q1263534) (← links)
• A fast LU update for linear programming (Q1309856) (← links)
• Sensitivity method for basis inverse representation in multistage stochastic linear programming problems (Q1321212) (← links)
• Symbiosis between linear algebra and optimization (Q1591197) (← links)
• A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
• Maintaining LU factors of a general sparse matrix (Q1822448) (← links)
• Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
• A two-phase support method for solving linear programs: numerical experiments (Q1954826) (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) (← links)
• Accelerating the HS-type Richardson iteration method with Anderson mixing (Q2106864) (← links)
• A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
• Novel update techniques for the revised simplex method (Q2352418) (← links)
• A numerically stable form of the simplex algorithm (Q2558746) (← links)
• A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems (Q2638951) (← links)
• Evolutionary approach for large-scale mine scheduling (Q2663534) (← links)
• A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
• An active set quadratic programming algorithm for real-time model predictive control (Q3423599) (← links)
• Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos (Q3621498) (← links)
• The best parameter subset using the Chebychev curve fitting criterion (Q3662506) (← links)
• Stable modification of explicitLU factors for simplex updates (Q3692731) (← links)
• On the Numerical Stability of Simplex-Algorithms (Q3768670) (← links)
• A bump triangular dynamic factorization algorithm for the simplex method (Q3865837) (← links)
• A dual method for discrete Chebychev curve fitting (Q3885510) (← links)
• A linear programming algorithm for curve fitting in the L_∞norm (Q3894859) (← links)
• A New Method for Chebyshev Approximation of Complex-Valued Functions (Q3913044) (← links)
• An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
• Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
• The column-updating method for solving nonlinear equations in Hilbert space (Q3988575) (← links)
• Chebyshev solution of overdetermined systems of linear equations (Q4058016) (← links)
• A numerically stable optimization method based on A homogeneous function (Q4121691) (← links)
• Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218) (← links)
• On the Bartels—Golub decomposition for linear programming bases (Q4158808) (← links)
• Large-scale linearly constrained optimization (Q4162963) (← links)
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results (Q4165158) (← links)
• Stable algorithm for updating dense<i>LU</i>factorization after row or column exchange and row and column addition or deletion (Q4327873) (← links)
• Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
• LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method (Q4777052) (← links)
• Permutations in the Factorization of Simplex Bases (Q5139619) (← links)
• Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)