A REDUCED HESSIAN METHOD FOR LARGE - SCALECONSTRAINED OPTIMIZATIONbyLorenz
نویسندگان
چکیده
We propose a quasi-Newton algorithm for solving large optimization problems with nonlinear equality constraints. It is designed for problems with few degrees of freedom and is motivated by the need to use sparse matrix factorizations. The algorithm incorporates a correction vector that approximates the cross term Z T WY p Y in order to estimate the curvature in both the range and null spaces of the constraints. The algorithm can be considered to be, in some sense, a practical implementation of an algorithm of Coleman and Conn. We give conditions under which local and superlinear convergence is obtained.
منابع مشابه
Numerical Experience with a Reduced Hessianmethod for Large Scaleconstrained
The reduced Hessian SQP algorithm presented in 2] is developed in this paper into a practical method for large-scale optimization. The novelty of the algorithm lies in the incorporation of a correction vector that approximates the cross term Z T WY p Y. This improves the stability and robustness of the algorithm without increasing its computational cost. The paper studies how to implement the a...
متن کاملLimited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
Limited-memory BFGS quasi-Newton methods approximate the Hessian matrix of second derivatives by the sum of a diagonal matrix and a fixed number of rank-one matrices. These methods are particularly effective for large problems in which the approximate Hessian cannot be stored explicitly. It can be shown that the conventional BFGS method accumulates approximate curvature in a sequence of expandi...
متن کاملOPTIMIZATION TECHNOLOGY CENTER Argonne National Laboratory and Northwestern University NUMERICAL EXPERIENCE WITH A REDUCED HESSIAN METHOD FOR LARGE SCALE CONSTRAINED OPTIMIZATION by
The reduced Hessian SQP algorithm presented in is developed in this paper into a practical method for large scale optimization The novelty of the algorithm lies in the incorporation of a correction vector that approximates the cross term ZWY pY This improves the stability and robustness of the algorithm without increasing its computational cost The paper studies how to implement the algorithm e...
متن کاملA class of multi-agent discrete hybrid non linearizable systems: Optimal controller design based on quasi-Newton algorithm for a class of sign-undefinite hessian cost functions
In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...
متن کاملPreconditioned All-at-once Methods for Large, Sparse Parameter Estimation Problems
The problem of recovering a parameter function based on measurements of solutions of a system of partial diierential equations in several space variables leads to a number of computational challenges. Upon discretization of a regularized formulation a large, sparse constrained optimization problem is obtained. Typically in the literature , the constraints are eliminated and the resulting uncons...
متن کامل