An alogrithm for monotonic global optimization problems<sup>∗</sup> (Q2720273): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3126366 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lipschitz programming via increasing convex-along-rays functions<sup>*</sup> / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4339231 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Canonical DC programming problem: Outer approximation methods revisited / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex analysis and global optimization / rank | |||
Normal rank | |||
Latest revision as of 17:45, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alogrithm for monotonic global optimization problems<sup>∗</sup> |
scientific article |
Statements
An alogrithm for monotonic global optimization problems<sup>∗</sup> (English)
0 references
22 January 2003
0 references
abstract quasiconvexity
0 references
increasing function
0 references
outer approximation
0 references
feasible set
0 references
