State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
From MaRDI portal
Publication:301689
DOI10.1007/s10589-015-9821-xzbMath1348.49024OpenAlexW2229157217MaRDI QIDQ301689
Timothy A. Davis, Begüm Şenses Cannataro, Anil V. Rao
Publication date: 1 July 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9821-x
discretizationoptimal controlgraph coarseningKarush-Kuhn-Tucker systemsorthogonal collocation methods
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Discrete approximations in optimal control (49M25)
Related Items
Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems, Optimal deployment of spin-stabilized tethered formations with continuous thrusters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient parallel solution of large-scale nonlinear dynamic optimization problems
- Pseudospectral methods for solving infinite-horizon optimal control problems
- Direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using a Radau pseudospectral method
- A unified framework for the numerical solution of optimal control problems using pseudospectral methods
- Convergence rates for direct transcription of optimal control problems using collocation at Radau points
- Connections between the covector mapping theorem and convergence of pseudospectral methods for optimal control
- Multilevel optimization in VLSICAD
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Advanced Coarsening Schemes for Graph Partitioning
- Algorithm 902
- The university of Florida sparse matrix collection
- Direct Methods for Sparse Linear Systems
- Costate approximation in optimal control using integral Gaussian quadrature orthogonal collocation methods
- Aphmesh refinement method for optimal control
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- A linear time implementation of the reverse Cuthill-McKee algorithm
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An Approximate Minimum Degree Ordering Algorithm
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- The pseudospectral Legendre method for discretizing optimal control problems
- An hp‐adaptive pseudospectral method for solving optimal control problems
- GPOPS-II
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Algorithm 837
- Nested Dissection of a Regular Finite Element Mesh
- Optimal patterns of glider dynamic soaring
- A method for the solution of certain non-linear problems in least squares
- Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems
