Second-order optimality conditions for \(C^1\) multiobjective programming problems (Q696130): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Angelo Guerraggio / rank | |||
Property / author | |||
Property / author: Dinh The Luc / rank | |||
Property / author | |||
Property / author: Nguyen Ba Minh / rank | |||
Property / reviewed by | |||
Property / reviewed by: Tadeusz Trzaskalik / rank | |||
Property / author | |||
Property / author: Angelo Guerraggio / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Dinh The Luc / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Nguyen Ba Minh / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Tadeusz Trzaskalik / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:59, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Second-order optimality conditions for \(C^1\) multiobjective programming problems |
scientific article |
Statements
Second-order optimality conditions for \(C^1\) multiobjective programming problems (English)
0 references
14 January 2004
0 references
There exist a huge number of papers in which continuously differentiable problems with inequality constraints are stuidied. Quite few publications exist on second order conditions. The purpose if the paper is to establish such conditions for constrained multiobjective programming problems with continuously differentiable data (named \(C^1\) data). In the paper the definition of approximate Jacobian and approximate Hessian is recalled (section 2). Then necessary conditions (section 3) and sufficient conditions (section 4) are formulated and proved. In the example (section 5) it is shown how the recession Hessian matrices cannot be removed when the data of the problem are of class \(C^1\).
0 references
constrained multiobjective programming
0 references
approximate Jacobian
0 references
approximate Hessian
0 references