State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
type: Item
instance of: scholarly article
title: State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
zbMATH Open document ID: 1348.49024
author: Begüm Şenses Cannataro
author: Anil V. Rao
author: Timothy A. Davis
published in: Computational Optimization and Applications
publication date: 2016-07-01T00:00:00Z
Mathematics Subject Classification ID: 49M25
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6600336
zbMATH Keywords: optimal control
zbMATH Keywords: discretization
zbMATH Keywords: orthogonal collocation methods
zbMATH Keywords: Karush-Kuhn-Tucker systems
zbMATH Keywords: graph coarsening
describes a project that uses: AMD
describes a project that uses: MA47
describes a project that uses: CSparse
describes a project that uses: MA57
describes a project that uses: PARDISO
describes a project that uses: GPOPS
describes a project that uses: SNOPT
describes a project that uses: MUMPS
describes a project that uses: SparseMatrix
describes a project that uses: Ipopt
describes a project that uses: SOCS
describes a project that uses: MA27
MaRDI profile type: Publication
full work available at URL: s10589-015-9821-x
OpenAlex ID: W2229157217
cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
cites work: Algorithm 837
cites work: MA57---a code for the solution of sparse symmetric definite and indefinite systems
cites work: Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems
cites work: The pseudospectral Legendre method for discretizing optimal control problems
cites work: Q4345580
cites work: Connections between the covector mapping theorem and convergence of pseudospectral methods for optimal control
cites work: Algorithm 902
cites work: An hp‐adaptive pseudospectral method for solving optimal control problems
cites work: Convergence rates for direct transcription of optimal control problems using collocation at Radau points
cites work: Direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using a Radau pseudospectral method
cites work: A unified framework for the numerical solution of optimal control problems using pseudospectral methods
cites work: Pseudospectral methods for solving infinite-horizon optimal control problems
cites work: GPOPS-II
cites work: Aphmesh refinement method for optimal control
cites work: Costate approximation in optimal control using integral Gaussian quadrature orthogonal collocation methods
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: A linear time implementation of the reverse Cuthill-McKee algorithm
cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs
cites work: Q4288580
cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
cites work: Multilevel optimization in VLSICAD
cites work: Advanced coarsening schemes for graph partitioning
cites work: Efficient parallel solution of large-scale nonlinear dynamic optimization problems
cites work: Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
cites work: A method for the solution of certain non-linear problems in least squares
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear
cites work: The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
cites work: Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
cites work: Optimal patterns of glider dynamic soaring
cites work: Q4280834
cites work: An Approximate Minimum Degree Ordering Algorithm
cites work: Nested Dissection of a Regular Finite Element Mesh
cites work: An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
cites work: The university of Florida sparse matrix collection
cites work: Direct Methods for Sparse Linear Systems
DOI: 10.1007/S10589-015-9821-X
description: scientific article; zbMATH DE number 6600336