Conjugate points for a constrained nonlinear programming problem (Q2708291)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Conjugate points for a constrained nonlinear programming problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conjugate points for a constrained nonlinear programming problem |
scientific article |
Statements
27 November 2001
0 references
conjugate points
0 references
strict conjugate points
0 references
Jacobi equation
0 references
Legendre condition
0 references
positive definite
0 references
shortest path problem
0 references
Sylvester's criterion
0 references
principal minors
0 references
Conjugate points for a constrained nonlinear programming problem (English)
0 references
In a former paper by the author, the notion of conjugate point for unconstrained finite dimensional optimization problems was introduced. This notion is based on the discretized version of the Jacobi equation related to the second-order Hessian matrix of the objective function. The aim of this paper is to extend this theory to the inequality-equality constrained situation and offer necessary and sufficient conditions of optimality for such programming problems. As an illustration, the finite-dimensional version of the shortest path problem on the unit sphere is analyzed.
0 references
