Successive element correction algorithms for sparse unconstrained optimization

DOI10.1007/BF00940448MaRDI QIDQ1321350zbMATH OpenFDO

Authors V. Pereyra

Publication date 26 September 1994

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

symmetrysparsityunconstrained optimizationapproximate Hessiansecant modificationsuccessive element correction algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Sparsity in higher order methods for unconstrained optimization
• Corrected sequential linear programming for sparse minimax optimization
• A successive convex approximation approach for sparse solutions of convex programs
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• A unifying framework for sparsity-constrained optimization
• An efficient algorithm for non-convex sparse optimization
• scientific article; zbMATH DE number 640536
• Sparse Matrix Methods in Optimization
• Sparse Optimization with Least-Squares Constraints
• Algorithms for sparsity-constrained optimization

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3936369 (Why is no real title available?)
• scientific article; zbMATH DE number 3430031 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Estimation of sparse hessian matrices and graph coloring problems
• Memory gradient method for the minimization of functions
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
• On the Estimation of Sparse Hessian Matrices
• Software for estimating sparse Jacobian matrices
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• Testing Unconstrained Optimization Software

Cited in

(3)

• On the convergence of partitioning group correction algorithms
• Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
• Inexact trust region PGC method for large sparse unconstrained optimization

Describes a project that uses

Uses Software

• minpack

This page was built for publication: Successive element correction algorithms for sparse unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321350)