Convergent stepsizes for constrained optimization algorithms (Q1061005)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Convergent stepsizes for constrained optimization algorithms |
scientific article |
Statements
Convergent stepsizes for constrained optimization algorithms (English)
0 references
1986
0 references
A fundamental problem in constrained nonlinear optimization algorithms is the design of a satisfactory stepsize strategy which converges to unity. We discuss stepsize strategies for Newton or quasi-Newton algorithms which require the solution of quadratic optimization subproblems. Five stepsize strategies are considered for three different subproblems, and the conditions under which the stepsizes will converge to unity are established. It is shown that these conditions depend critically on the convergence of the Hessian approximations used in the algorithms. The stepsize strategies are constructed using basic principles from which the conditions to unit stepsizes follow. Numerical results are discussed in an Appendix.
0 references
constrained nonlinear optimization
0 references
stepsize strategy
0 references
quasi-Newton algorithms
0 references
Hessian approximations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references