Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- 1 September 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 36 (5) , 1750-1794
- https://doi.org/10.1137/s036012995279031
Abstract
No abstract availableThis publication has 36 references indexed in Scilit:
- An interior Newton method for quadratic programmingMathematical Programming, 1999
- On interior-point Newton algorithms for discretized optimal control problems with state constraints∗Optimization Methods and Software, 1998
- An Interior Trust Region Approach for Nonlinear Minimization Subject to BoundsSIAM Journal on Optimization, 1996
- Projected Sequential Quadratic Programming MethodsSIAM Journal on Optimization, 1996
- An Infinite-Dimensional Convergence Theory for Reduced SQP Methods in Hilbert SpaceSIAM Journal on Optimization, 1996
- A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the SubproblemSIAM Journal on Optimization, 1995
- Reduced SQP Methods for Parameter Identification ProblemsSIAM Journal on Numerical Analysis, 1992
- Quadratically constrained least squares and quadratic problemsNumerische Mathematik, 1991
- Estimation of a temporally and spatially varying diffusion coefficient in a parabolic system by an augmented Lagrangian techniqueNumerische Mathematik, 1991
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained OptimizationSIAM Journal on Numerical Analysis, 1991