Reduction constraints for the global optimization of NLPs (Q4654430): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Jointly Constrained Biconvex Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing global minima to polynomial optimization problems using Gröbner bases / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recent developments and trends in global optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Global optimization of nonconvex factorable programming problems / rank | |||
Normal rank | |||
Latest revision as of 19:20, 7 June 2024
scientific article; zbMATH DE number 2140667
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduction constraints for the global optimization of NLPs |
scientific article; zbMATH DE number 2140667 |
Statements
Reduction constraints for the global optimization of NLPs (English)
0 references
4 March 2005
0 references
0 references
