MA57---a code for the solution of sparse symmetric definite and indefinite systems
From MaRDI portal
Publication:5461188
DOI10.1145/992200.992202zbMath1070.65525OpenAlexW2033624514WikidataQ113309729 ScholiaQ113309729MaRDI QIDQ5461188
Publication date: 22 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/992200.992202
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Packaged methods for numerical algorithms (65Y15) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items
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 primal‐dual active‐set method for distributed model predictive control, A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, An inertia-free filter line-search algorithm for large-scale nonlinear programming, A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control, Structure exploitation in an interior-point method for fully discretized, state constrained optimal control problems, An augmented Lagrangian method exploiting an active-set strategy and second-order information, Primal and dual active-set methods for convex quadratic programming, Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems, Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations, An efficient analyse phase for element problems, FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming, 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, Stable and Efficient Computation of Generalized Polar Decompositions, On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities, A face‐centred finite volume method for high‐contrast Stokes interface problems, Towards an efficient augmented Lagrangian method for convex quadratic programming, A regularization method for constrained nonlinear least squares, Direct multiple shooting and direct collocation perform similarly in biomechanical predictive simulations, A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems, An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix, How good are projection methods for convex feasibility problems?, 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, Network Modeling of Fluid Transport Through Sea Ice with Entrained Exopolymeric Substances, A study of structure-exploiting SQP algorithms for an optimal control problem with coupled hyperbolic and ordinary differential equation constraints, Preconditioning for Allen-Cahn variational inequalities with non-local constraints, On parallelizing dual decomposition in stochastic integer programming, An overlapping decomposition framework for wave propagation in heterogeneous and unbounded media: formulation, analysis, algorithm, and simulation, Study of a primal-dual algorithm for equality constrained minimization, An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems, Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots, New parallel sparse direct solvers for multicore architectures, A Regularized Factorization-Free Method for Equality-Constrained Optimization, A Hypergraph Partitioning Model for Profile Minimization, 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, Structured regularization for barrier NLP solvers, Distributed control and constraint preconditioners, A survey of direct methods for sparse linear systems, Sparse-representation-based direct minimum \(L^p\)-norm algorithm for MRI phase unwrapping, 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, On solving trust-region and other regularised subproblems in optimization, A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems, A tearing-based hybrid parallel sparse linear system solver, A discrete adjoint based level set topology optimization method for stress constraints, Optimal Storage Operation with Model Predictive Control in the German Transmission Grid, Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, High-order tetrahedral finite elements applied to large deformation analysis of functionally graded rubber-like materials, FORCES NLP: an efficient implementation of interior-point methods for multistage nonlinear nonconvex programs, The design and use of a sparse direct solver for skew symmetric matrices, On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics, A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting, Projection onto a Polyhedron that Exploits Sparsity, MA57, A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows, A general framework for robust topology optimization under load-uncertainty including stress constraints, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization, A primal–dual regularized interior-point method for semidefinite programming, Methods for convex and general quadratic programming, A numerical solution of Richards equation: a simple method adaptable in parallel computing
Uses Software
