1983•Defense Technical Information Center (DTIC)Requires access

The Lack of Positive Definiteness in the Hessian in Constrained Optimization

Rodrigo Fontecilla

Open publisher page 3 citations

Abstract

The use of the DFP or the BFGS secant updates requires the Hessian at the solution to be positive-definite. The second order sufficiency conditions insure the positive definiteness only in a sub-space of R(exp n). Conditions are given so the author can safely update with either update. The author proposes a new class of algorithms that generate a sequence converging 2-step q-superlinearly. He also proposes two specific algorithms. The first one converges q-superlinearly if the Hessian is positive-definite in R(exp n), and it converges 2-step q-superlinearly if the Hessian is positive-definite only in a subspace. The second one generates a sequence converging 1-step q-superlinearly. While the former costs one extra gradient evaluation, the latter costs one extra gradient evaluation and one extra function evaluation on the constraints.

About this research paper

What this paper is about

The use of the DFP or the BFGS secant updates requires the Hessian at the solution to be positive-definite. The second order sufficiency conditions insure the positive definiteness only in a sub-space of R(exp n). Conditions are given so the author can safely update with either update. The author proposes a new class of algorithms that generate a sequence converging 2-step q-superlinearly. He also proposes two specific algorithms. The first one converges q-superlinearly if the Hessian is positive-definite in R(exp n), and it converges 2-step q-superlinearly if the Hessian is positive-definite only in a subspace. The second one generates a sequence converging 1-step q-superlinearly. While the former costs one extra gradient evaluation, the latter costs one extra gradient evaluation and one extra function evaluation on the constraints.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The use of the DFP or the BFGS secant updates requires the Hessian at the solution to be positive-definite. The second order sufficiency conditions insure the positive definiteness only in a sub-space of R(exp n). Conditions are given so the author can safely update with either update. The author proposes a new class of algorithms that generate a sequence converging 2-step q-superlinearly. He also proposes two specific algorithms. The first one converges q-superlinearly if the Hessian is positive-definite in R(exp n), and it converges 2-step q-superlinearly if the Hessian is positive-definite only in a subspace. The second one generates a sequence converging 1-step q-superlinearly. While the former costs one extra gradient evaluation, the latter costs one extra gradient evaluation and one extra function evaluation on the constraints.

Key concepts: Hessian matrix, Positive definiteness, Mathematics, Positive-definite matrix, Subspace topology, Definiteness, Sequence (biology), Quasi-Newton method

Related papers

Back to paper searchBrowse research topicsOriginal source
The Lack of Positive Definiteness in the Hessian in Constrained Optimization — Research Paper | ScholarLens