MA57

swMATH536MaRDI QIDQ13291FDOQ13291

Author name not available (Why is that?)

Described by source

• MA57---a code for the solution of sparse symmetric definite and indefinite systems

Cited In (97)

• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
• CGPOPS: a C++ software for solving multiple-phase optimal control problems using adaptive Gaussian quadrature collocation and sparse nonlinear programming
• On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics
• A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems
• FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
• Barrier function based model predictive control
• A regularization method for constrained nonlinear least squares
• Distributed control and constraint preconditioners
• FORCES NLP: an efficient implementation of interior-point methods for multistage nonlinear nonconvex programs
• A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
• Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method
• Using FGMRES to obtain backward stability in mixed precision
• A discrete adjoint based level set topology optimization method for stress constraints
• Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
• New parallel sparse direct solvers for multicore architectures
• A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
• Scaling and pivoting in an out-of-core sparse direct solver
• Finite-element preconditioning of G-NI spectral methods
• Nonlinear programming without a penalty function or a filter
• A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
• Projection onto a polyhedron that exploits sparsity
• Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
• Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
• An inertia-free filter line-search algorithm for large-scale nonlinear programming
• An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems
• State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
• Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
• Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems
• A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• Preconditioning for Allen-Cahn variational inequalities with non-local constraints
• A tearing-based hybrid parallel sparse linear system solver
• Primal and dual active-set methods for convex quadratic programming
• Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
• A regularized interior-point method for constrained linear least squares
• Pivoting strategies for tough sparse indefinite systems
• The design and use of a sparse direct solver for skew symmetric matrices
• On solving trust-region and other regularised subproblems in optimization
• Block-structured quadratic programming for the direct multiple shooting method for optimal control
• A comparison of projective and direct solvers for finite elements in elastostatics
• High-order tetrahedral finite elements applied to large deformation analysis of functionally graded rubber-like materials
• A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• Object-oriented software for quadratic programming
• A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
• Large deformation analysis of elastoplastic homogeneous materials via high order tetrahedral finite elements
• Towards an efficient augmented Lagrangian method for convex quadratic programming
• Sequential quadratic programming methods
• A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
• Study of a primal-dual algorithm for equality constrained minimization
• On implicit-factorization constraint preconditioners
• An augmented Lagrangian method exploiting an active-set strategy and second-order information
• Iterative solution of symmetric quasi-definite linear systems
• How good are projection methods for convex feasibility problems?
• On parallelizing dual decomposition in stochastic integer programming
• An efficient overloaded method for computing derivatives of mathematical functions in MATLAB
• Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
• Sequential quadratic programming with indefinite Hessian approximations for nonlinear optimum experimental design for parameter estimation in differential-algebraic equations
• Convergence analysis of Euler discretization of control-state constrained optimal control problems with controls of bounded variation
• A numerical solution of Richards equation: a simple method adaptable in parallel computing
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
• Design of a multicore sparse Cholesky factorization using DAGs
• An iterative working-set method for large-scale nonconvex quadratic programming
• Methods for convex and general quadratic programming
• 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
• Structure exploitation in an interior-point method for fully discretized, state constrained optimal control problems
• A factorization with update procedures for a KKT matrix arising in direct optimal control
• Extensions of Certain Graph-based Algorithms for Preconditioning
• Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
• A dual gradient-projection method for large-scale strictly convex quadratic problems
• Structured regularization for barrier NLP solvers
• An overlapping decomposition framework for wave propagation in heterogeneous and unbounded media: formulation, analysis, algorithm, and simulation
• Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
• An efficient analyse phase for element problems.
• A general framework for robust topology optimization under load-uncertainty including stress constraints
• A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
• Nonlinear programming strategies for state estimation and model predictive control
• Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
• Algorithm 930: FACTORIZE: an object-oriented linear system solver for MATLAB
• An adaptively regularized sequential quadratic programming method for equality constrained optimization
• A new sparse \(LDL^T\) solver using a posteriori threshold pivoting
• HyKKT: a hybrid direct-iterative method for solving KKT linear systems
• A regularized factorization-free method for equality-constrained optimization
• Topology optimization of Stokes flow with traction boundary conditions using low-order finite elements
• A comparative study of null-space factorizations for sparse symmetric saddle point systems.
• Network modeling of fluid transport through sea ice with entrained exopolymeric substances
• Wilkinson's inertia-revealing factorization and its application to sparse matrices.
• 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
• An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
• A fast solver for an H1 regularized PDE-constrained optimization problem
• A primal-dual active-set method for distributed model predictive control

This page was built for software: MA57