A sparse nonlinear optimization algorithm

DOI10.1007/BF02192216zbMath0843.90106MaRDI QIDQ1337223

Paul D. Frank, John T. Betts

Publication date: 30 October 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

sequential quadratic programmingtrajectory optimizationsparse nonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming ⋮ Principal classifications analysis: a method for generating consensus dendrograms and its application to three-way data. ⋮ A sweeping gradient method for ordinary differential equations with events ⋮ A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory ⋮ Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods ⋮ A dual gradient-projection method for large-scale strictly convex quadratic problems ⋮ Optimal parameter estimation of dynamical systems using direct transcription methods ⋮ Eigenvector approximate dichotomic basis method for solving hyper-sensitive optimal control problems ⋮ A stable elemental decomposition for dynamic process optimization ⋮ Some comments on DAE theory for IRK methods and trajectory optimization ⋮ Compensating for order variation in mesh refinement for direct transcription methods

Uses Software

• NPSOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pointwise quasi-Newton method for unconstrained optimal control problems
• The multiplier method of Hestenes and Powell applied to convex programming
• Inertia-Controlling Methods for General Quadratic Programming
• Semi-Definite Matrix Constraints in Optimization
• Application of sparse nonlinear programming to trajectory optimization
• A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
• The influence of relaxed supernode partitions on the multifrontal method
• Path-constrained trajectory optimization using sparse sequential quadratic programming
• Trajectory optimization on a parallel processor

This page was built for publication: A sparse nonlinear optimization algorithm