A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem (Q1095037): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Generalized equations and their solutions, part II: Applications to nonlinear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution point differentiability without strict complementarity in nonlinear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sensitivity analysis for nonlinear programming using penalty methods / rank | |||
Normal rank | |||
Latest revision as of 13:26, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem |
scientific article |
Statements
A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem (English)
0 references
1989
0 references
What happens when a nonconvex program, having a local solution \(x^ 0\) at which the gradients of the binding constraints are linearly independent, but without strict complementarity hypothesis, is perturbed? Under a relatively weak second-order assumption (some nonnegative second- order terms is supposed to be strictly positive), the perturbed problem has, in the neighborhood of \(x^ 0\), a finite number of local minima, situated on curves that are connected to some pseudo-solutions of the tangent quadratic problem.
0 references
nonconvex program
0 references
perturbation of nonlinear programs
0 references
sufficiency conditions for optimality
0 references
