Pages that link to "Item:Q1337223"
From MaRDI portal
The following pages link to A sparse nonlinear optimization algorithm (Q1337223):
Displaying 18 items.
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming (Q833407) (← links)
- Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods (Q927222) (← links)
- A sparse sequential quadratic programming algorithm (Q1095793) (← links)
- Principal classifications analysis: a method for generating consensus dendrograms and its application to three-way data. (Q1129103) (← links)
- A stable elemental decomposition for dynamic process optimization (Q1578842) (← links)
- Some comments on DAE theory for IRK methods and trajectory optimization (Q1578851) (← links)
- An algorithm for solving sparse nonlinear least squares problems (Q1822462) (← links)
- Compensating for order variation in mesh refinement for direct transcription methods (Q1841951) (← links)
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory (Q1937080) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- Optimal parameter estimation of dynamical systems using direct transcription methods (Q3588245) (← links)
- Global optimization for sparse solution of least squares problems (Q5058393) (← links)
- Eigenvector approximate dichotomic basis method for solving hyper-sensitive optimal control problems (Q5317778) (← links)
- (Q5452936) (← links)
- Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming (Q5939946) (← links)
- General algorithm for analytical calculations of Jacobi matrix elements in sparse nonlinear programming problems (Q6043892) (← links)
- A sweeping gradient method for ordinary differential equations with events (Q6086137) (← links)