Accelerating condensed interior-point methods on SIMD/GPU architectures
From MaRDI portal
Recommendations
- Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures
- HyKKT: a hybrid direct-iterative method for solving KKT linear systems
- Structure-exploiting interior point methods
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- scientific article; zbMATH DE number 432998
Cites work
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3402374 (Why is no real title available?)
- A Modeling Language for Mathematical Programming
- A Reduced Hessian Method for Large-Scale Constrained Optimization
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Direct methods for sparse matrices
- Evaluating Derivatives
- Exponential decay of sensitivity in graph-structured nonlinear programs
- JuMP: a modeling language for mathematical optimization
- Minimizing a differentiable function over a differential manifold
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part I: The Krylov--Schur Solver
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Cited in
(1)
This page was built for publication: Accelerating condensed interior-point methods on SIMD/GPU architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596333)
