Orthogonal and conjugate basis methods for solving equality constrained minimization problems
The authors describe and analyze two methods to construct the search direction during a step of the iterative process approximating solutions of equality-constrained minimization problems of the form \[ F(x) = \min!\mid c_ i(x) = 0,\quad i = 1,2,\dots,m. \] The very popular approach consists in calculating two orthogonal components of the search direction (i.e. tangential and normal to the constraints). The methods of this kind are called orthogonal basis methods. The second method, based on an idea given by L. C. W. Dixon (in a technical report of the Hatfield Polytechnics in 1987) and consisting in construction of the search direction from two moves which are conjugate with respect to the Hessian of the Lagrangian function, called conjugate basis method, is contrasted with the first one. The paper also contains an informal description of minimization algorithms for the two methods and the analysis of their local convergence properties, illustrated with some results of numerical experiments. The authors conclude that the (as theoretical as empirical) benefits of the second method encourage to the further investigations of the conjugate basis approach, and announce some new research tasks touched on by L. C. W. Dixon and the second author, related to the use of the so called restoration steps technique.
- A globally convergent method for nonlinear programming
- A numerically stable dual method for solving strictly convex quadratic programs
- A tolerant algorithm for linearly constrained optimization calculations
- An algorithm for composite nonsmooth optimization problems
- An analysis of reduced Hessian methods for constrained optimization
- An example of irregular convergence in some constrained optimization methods that use the projected Hessian
- An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Nonlinear programming via an exact penalty function: Global analysis
- On Secant Updates for Use in General Constrained Optimization
- On the Convergence of Constrained Optimization Methods with Accurate Hessian Information on a Subspace
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
- On the quadratic programming algorithm of Goldfarb and Idnani
- Test examples for nonlinear programming codes
This page was built for publication: Orthogonal and conjugate basis methods for solving equality constrained minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312090)