MA57---a code for the solution of sparse symmetric definite and indefinite systems
From MaRDI portal
Recommendations
Cited in
(89)- The design and use of a sparse direct solver for skew symmetric matrices
- MA57
- Sparse algorithms for indefinite system of linear equations
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Structure exploitation in an interior-point method for fully discretized, state constrained optimal control problems
- Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- A study of structure-exploiting SQP algorithms for an optimal control problem with coupled hyperbolic and ordinary differential equation constraints
- Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
- New parallel sparse direct solvers for multicore architectures
- High-order tetrahedral finite elements applied to large deformation analysis of functionally graded rubber-like materials
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
- Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
- A discrete adjoint based level set topology optimization method for stress constraints
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Towards an efficient augmented Lagrangian method for convex quadratic programming
- A regularization method for constrained nonlinear least squares
- An overlapping decomposition framework for wave propagation in heterogeneous and unbounded media: formulation, analysis, algorithm, and simulation
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- Topology optimization of Stokes flow with traction boundary conditions using low-order finite elements
- Large deformation analysis of elastoplastic homogeneous materials via high order tetrahedral finite elements
- Sparse-representation-based direct minimum \(L^p\)-norm algorithm for MRI phase unwrapping
- A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems
- A general framework for robust topology optimization under load-uncertainty including stress constraints
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Methods for convex and general quadratic programming
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
- How good are projection methods for convex feasibility problems?
- On parallelizing dual decomposition in stochastic integer programming
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- Projection onto a polyhedron that exploits sparsity
- An inertia-free filter line-search algorithm for large-scale nonlinear programming
- An efficient analyse phase for element problems.
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
- On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics
- A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
- Primal and dual active-set methods for convex quadratic programming
- An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems
- Convergence analysis of Euler discretization of control-state constrained optimal control problems with controls of bounded variation
- A factorization with update procedures for a KKT matrix arising in direct optimal control
- The design of MA48
- Preconditioning for Allen-Cahn variational inequalities with non-local constraints
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Network modeling of fluid transport through sea ice with entrained exopolymeric substances
- A regularized factorization-free method for equality-constrained optimization
- A hypergraph partitioning model for profile minimization
- Optimal storage operation with model predictive control in the German transmission grid
- Study of a primal-dual algorithm for equality constrained minimization
- A numerical solution of Richards equation: a simple method adaptable in parallel computing
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Stable and efficient computation of generalized polar decompositions
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- FORCES NLP: an efficient implementation of interior-point methods for multistage nonlinear nonconvex programs
- A new sparse LDL^T solver using a posteriori threshold pivoting
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Structured regularization for barrier NLP solvers
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- A primal-dual regularized interior-point method for semidefinite programming
- A primal-dual active-set method for distributed model predictive control
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Distributed control and constraint preconditioners
- A survey of direct methods for sparse linear systems
- HyKKT: a hybrid direct-iterative method for solving KKT linear systems
- A regularized interior-point method for constrained linear least squares
- A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
- A face‐centred finite volume method for high‐contrast Stokes interface problems
- Direct multiple shooting and direct collocation perform similarly in biomechanical predictive simulations
- Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques
- Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations
- A generalization of the Riccati recursion for equality‐constrained linear quadratic optimal control
- A projected-search interior-point method for nonlinearly constrained optimization
- On the shift-invert Lanczos method for the buckling eigenvalue problem
- Approximating sparse Hessian matrices using large-scale linear least squares
- Second-order cone programming for frictional contact mechanics using interior point algorithm
- Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures
- A rational filtering algorithm for sequences of shifted symmetric linear systems with applications to frequency response analysis
- Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification
- Sparse linear least-squares problems
- LCQPow: a solver for linear complementarity quadratic programs
- Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems
- A massively parallel interior-point method for arrowhead linear programs with local linking structure
- Including limb-on-limb holonomic constraints in predictive simulation allows replicating athlete's backflip technique
- A unified funnel restoration SQP algorithm
- On solving trust-region and other regularised subproblems in optimization
- A tearing-based hybrid parallel sparse linear system solver
Describes a project that uses
Uses Software
This page was built for publication: MA57---a code for the solution of sparse symmetric definite and indefinite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461188)
