Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm |
scientific article; zbMATH DE number 6876684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm |
scientific article; zbMATH DE number 6876684 |
Statements
Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (English)
0 references
30 May 2018
0 references
nonlinear programming
0 references
derivative-free optimization
0 references
quadratic programming
0 references
trust-region subproblem
0 references
mesh adaptive direct search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7693015933036804
0 references
0.7653866410255432
0 references
0.7485551834106445
0 references
0.7446841597557068
0 references
