Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

DOI10.1137/21M1393819MaRDI QIDQ5022491

Cosmin G. Petra, Roummel F. Marcia, Michael A. Saunders, Johannes J. Brust

Publication date: 19 January 2022

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.11048

zbMATH Keywords

large-scale optimizationtrust-region methodLSQRlimited memorycompact representationsparse QR

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

A limited-memory trust-region method for nonlinear optimization with many equality constraints

Uses Software

• KNITRO
• LSQR
• L-BFGS-B
• L-BFGS
• CUTEr
• SifDec
• SuiteSparse
• SparseMatrix
• Ipopt
• LBFGS-B
• SuiteSparseQR
• SuitSparseQR
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• On solving L-SR1 trust-region subproblems
• On the limited memory BFGS method for large scale optimization
• Representations of quasi-Newton matrices and their use in limited memory methods
• Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints
• A dense initialization for limited-memory quasi-Newton methods
• On efficiently combining limited-memory and trust-region techniques
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• The university of Florida sparse matrix collection
• Algorithm 915, SuiteSparseQR
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• Updating Quasi-Newton Matrices with Limited Storage
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Newton-type methods for unconstrained and linearly constrained optimization
• Algorithm 778: L-BFGS-B
• Trust Region Methods
• Compact representation of the full Broyden class of quasi‐Newton updates
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Anderson Accelerated Douglas--Rachford Splitting
• CUTEr and SifDec
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• Conditioning of Quasi-Newton Methods for Function Minimization
• Methods of conjugate gradients for solving linear systems
• Benchmarking optimization software with performance profiles.