Convexification, concavification and monotonization in global optimization (Q5959334): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:24, 30 January 2024
scientific article; zbMATH DE number 1723355
Language | Label | Description | Also known as |
---|---|---|---|
English | Convexification, concavification and monotonization in global optimization |
scientific article; zbMATH DE number 1723355 |
Statements
Convexification, concavification and monotonization in global optimization (English)
0 references
26 March 2002
0 references
The authors introduce a new approach by which via certain convexification, concavification and monotonization schemes a nonconvex optimization problem, over a simplex, can be converted into an equivalent better-structured nonconvex one. In this way studying a concave optimization problem or a D.C. (where D.C. stands for the difference of two convex functions) by means of the analytical tools proposed, the authors solve some interesting global optimization problems. The novel approach introduced in this paper, de facto, closes a gap between the generality and efficency in the current literature of global optimization.
0 references
convexification
0 references
concavification
0 references
monotonization
0 references
nonconvex optimization
0 references
global optimization
0 references