Pages that link to "Item:Q4107841"

The following pages link to Methods for Computing and Modifying the LDV Factors of a Matrix (Q4107841):

Displayed 19 items.

• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis (Q790580) ‎ (← links)
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems (Q790581) ‎ (← links)
• Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems (Q1070768) ‎ (← links)
• An active set RQP algorithm for engineering design optimization (Q1075123) ‎ (← links)
• The simplex method is not always well behaved (Q1109528) ‎ (← links)
• Least squares modifications with inverse factorizations: Parallel implications (Q1123540) ‎ (← links)
• A dual projective simplex method for linear programming (Q1129474) ‎ (← links)
• Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization (Q1192645) ‎ (← links)
• Analysis and implementation of a dual algorithm for constrained optimization (Q1321425) ‎ (← links)
• Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) ‎ (← links)
• Product-form Cholesky factorization in interior point methods for second-order cone programming (Q1777219) ‎ (← links)
• Computational methods for optimum design of large complex systems (Q1820022) ‎ (← links)
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) ‎ (← links)
• (Q3203937) ‎ (← links)
• Sparse matrix factor modification in structural reanalysis (Q3343586) ‎ (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) ‎ (← links)
• Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) ‎ (← links)
• An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) ‎ (← links)
• Large-scale linearly constrained optimization (Q4162963) ‎ (← links)