Leveraging GPU batching for scalable nonlinear programming through massive Lagrangian decomposition
From MaRDI portal
Cites work
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A new sparse LDL^T solver using a posteriori threshold pivoting
- A sparse symmetric indefinite direct solver for GPU architectures
- A two-level distributed algorithm for nonconvex constrained optimization
- Algorithm 778: L-BFGS-B
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- Batched triangular dense linear algebra kernels for very small matrix sizes on GPUs
- Checking local optimality in constrained quadratic programming is NP- hard
- Conic optimization via operator splitting and homogeneous self-dual embedding
- CUTEr and SifDec
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Incomplete Cholesky Factorizations with Limited Memory
- Julia: a fresh approach to numerical computing
- Newton's Method for Large Bound-Constrained Optimization Problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Towards dense linear algebra for hybrid GPU accelerated manycore systems
Cited in
(1)
This page was built for publication: Leveraging GPU batching for scalable nonlinear programming through massive Lagrangian decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917924)