dbo:abstract
|
- Biconvex optimization is a generalization of convex optimization where the objective function and the constraint set can be biconvex. There are methods that can find the global optimum of these problems. A set is called a biconvex set on if for every fixed , is a convex set in and for every fixed , is a convex set in . A function is called a biconvex function if fixing , is convex over and fixing , is convex over . A common practice for solving a biconvex problem (which does not guarantee global optimality of the solution) is alternatively updating by fixing one of them and solving the corresponding convex optimization problem. The generalization to functions of more than two argumentsis called a block multi-convex function.A functionis block multi-convexiff it is convex with respect to each of the individual argumentswhile holding all others fixed. (en)
|
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 2561 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
dbp:wikiPageUsesTemplate
| |
dcterms:subject
| |
rdfs:comment
|
- Biconvex optimization is a generalization of convex optimization where the objective function and the constraint set can be biconvex. There are methods that can find the global optimum of these problems. A set is called a biconvex set on if for every fixed , is a convex set in and for every fixed , is a convex set in . A function is called a biconvex function if fixing , is convex over and fixing , is convex over . (en)
|
rdfs:label
|
- Biconvex optimization (en)
|
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:wikiPageDisambiguates
of | |
is dbo:wikiPageWikiLink
of | |
is foaf:primaryTopic
of | |