Conjugate points for a constrained nonlinear programming problem
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.
- A conjugate points theory for a nonlinear programming problem
- Conjugate Points for Variational Problems with Equality and Inequality State Constraints
- Analysis of conjugate points for constant tridiagonal Hesse matrices of a class of extremal problems
- Convex cones and conjugacy for inequality control constraints
- Conjugacy for normal or abnormal linear Bolza problems
- A conjugate points theory for a nonlinear programming problem
- Analysis of conjugate points for constant tridiagonal Hesse matrices of a class of extremal problems
- Conjugate Points Revisited and Neumann–Neumann Problems
- scientific article; zbMATH DE number 3936398 (Why is no real title available?)
- Conjugate Points for Variational Problems with Equality and Inequality State Constraints
- scientific article; zbMATH DE number 2233661 (Why is no real title available?)
- On conjugate points and the Leitmann equivalent problem approach
- On the existence of conjugate points for a constrained minimization problem
This page was built for publication: Conjugate points for a constrained nonlinear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708291)