On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
From MaRDI portal
Publication:4158413
DOI10.2307/2006125zbMath0379.65034OpenAlexW4235085014WikidataQ58186006 ScholiaQ58186006MaRDI QIDQ4158413
Publication date: 1977
Full work available at URL: https://doi.org/10.2307/2006125
Related Items
Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization, On Variable-Metric Methods for Sparse Hessians, Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization, A sparse sequential quadratic programming algorithm, Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation, Matrix-free preconditioning using partial matrix estimation, Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization, On the convergence of partitioning group correction algorithms, Long vectors for quasi-Newton updates, Updating Quasi-Newton Matrices with Limited Storage, Computational experience with methods for estimating sparse hessians for nonlinear optimization, Sparse two-sided rank-one updates for nonlinear equations, An assessment of quasi-Newton sparse update techniques for nonlinear structural analysis, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Partitioned variable metric updates for large structured optimization problems, Approximating Hessians in unconstrained optimization arising from discretized problems, Global convergence of Schubert's method for solving sparse nonlinear equations, Sparse quasi-Newton updates with positive definite matrix completion, A partitioned PSB method for partially separable unconstrained optimization problems, Analysis of sparse quasi-Newton updates with positive definite matrix completion, Diagonal bundle method for nonsmooth sparse optimization, Distributed optimization and control with ALADIN, Local and superlinear convergence for truncated iterated projections methods, The Sequential Quadratic Programming Method, Partitioned quasi-Newton methods for sparse nonlinear equations, Multilevel least-change Newton-like methods for equality constrained optimization problems, The substitution secant/finite difference method for large scale sparse unconstrained optimization, A unified derivation of quasi-Newton methods for solving non-sparse and sparse nonlinear equations, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, A note on quasi-newton formulae for sparse second derivative matrices, A parallel computing scheme for minimizing a class of large scale functions, A note about sparsity exploiting quasi-Newton updates, Unnamed Item, Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods, Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm, A Kantorovich theorem for the structured PSB update in Hilbert space., Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function, On the generation of updates for quasi-Newton methods, A quasi-Newton method with sparse triple factorization for unconstrained minimization, Variable metric methods for unconstrained optimization and nonlinear least squares, Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations, A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm, Optimal matrix approximants in structural identification, Successive element correction algorithms for sparse unconstrained optimization
Cites Work
- Unified approach to quadratically convergent algorithms for function minimization
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Rapidly Convergent Descent Method for Minimization
- A Family of Variable-Metric Methods Derived by Variational Means
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- Variations on Variable-Metric Methods
- A New Algorithm for Unconstrained Optimization
