Direct methods for sparse matrices
Direct methods for sparse matrices
Practical methods of optimization; (2nd ed.)
Practical methods of optimization; (2nd ed.)
Sequential quadratic programming methods based on approximating a projected Hessian matrix
SIAM Journal on Scientific and Statistical Computing
Trust region algorithms for optimization with nonlinear equality and inequality constraints
Trust region algorithms for optimization with nonlinear equality and inequality constraints
Mathematical Programming: Series A and B
An analysis of reduced Hessian methods for constrained optimization
Mathematical Programming: Series A and B
Large-scale sequential quadratic programming algorithms
Large-scale sequential quadratic programming algorithms
Reduced Hessian algorithms for solving large-scale equality constrained optimization problems
Reduced Hessian algorithms for solving large-scale equality constrained optimization problems
On combining feasibility, descent and superlinear convergence in inequality constrained optimization
Mathematical Programming: Series A and B
A sparse nonlinear optimization algorithm
Journal of Optimization Theory and Applications
An assessment of nonmonotone linesearch techniques for unconstrained optimization
SIAM Journal on Scientific Computing
Test Examples for Nonlinear Programming Codes
Test Examples for Nonlinear Programming Codes
On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
SIAM Journal on Optimization
Computational Optimization and Applications
Neural network model-based automotive engine air/fuel ratio control and robustness evaluation
Engineering Applications of Artificial Intelligence
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Adaptive neural network model based predictive control for air-fuel ratio of SI engines
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
The reduced Hessian SQP algorithm presented in Biegleret al. [SIAM J. Optimization, Vol. 5, no. 2, pp. 314–347, 1995.] isdeveloped in this paper into a practical method for large-scaleoptimization. The novelty of the algorithm lies in the incorporationof a correction vector that approximates the cross term Z^TWY_p.This improves the stability and robustness of the algorithm withoutincreasing its computational cost. The paper studies how to implementthe algorithm efficiently, and presents a set of tests illustratingits numerical performance. An analytic example, showing the benefitsof the correction term, is also presented.