Mixed coordination method for non-linear programming problems with separable structures (Q4207299): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computational experience in sensitivity analysis for nonlinear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3702408 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sensitivity analysis for nonlinear programming using penalty methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extension of dual coordination to a class of non-linear systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem / rank | |||
Normal rank |
Revision as of 10:59, 20 June 2024
scientific article; zbMATH DE number 4127969
Language | Label | Description | Also known as |
---|---|---|---|
English | Mixed coordination method for non-linear programming problems with separable structures |
scientific article; zbMATH DE number 4127969 |
Statements
Mixed coordination method for non-linear programming problems with separable structures (English)
0 references
1989
0 references
Static optimization
0 references
linear equality constraints
0 references
separable structures
0 references
mixed coordination method
0 references
high-level updating scheme
0 references
modified Newton method
0 references
parallel implementation
0 references