MA27
From MaRDI portal
Software:24322
swMATH12393MaRDI QIDQ24322FDOQ24322
Author name not available (Why is that?)
Cited In (33)
- Computing projections for the Karmarkar algorithm
- On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Unsymmetric Ordering Using A Constrained Markowitz Scheme
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
- Evaluating Gas Network Capacities
- An inertia-free filter line-search algorithm for large-scale nonlinear programming
- Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization
- An efficient analyse phase for element problems
- Implementing cholesky factorization for interior point methods of linear programming
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
- Free material optimization for stress constraints
- Pivoting strategies for tough sparse indefinite systems
- On computing the inverse of a sparse matrix
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Object-oriented software for quadratic programming
- Title not available (Why is that?)
- An out-of-core sparse Cholesky solver
- An out-of-core sparse symmetric-indefinite factorization method
- An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems
- The design and analysis of the generalized finite element method
- A generalized envelope method for sparse factorization by rows
- Inertia-controlling factorizations for optimization algorithms
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
- Solution of sparse positive definite systems on a hypercube
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications
- Stability of the Diagonal Pivoting Method with Partial Pivoting
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Add-sub pivoting triangular factorization for symmetric matrix
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- The Snap-Back Pivoting Method for Symmetric Banded Indefinite Matrices
This page was built for software: MA27