Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GQTPAR / rank | |||
Normal rank | |||
Revision as of 02:23, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm |
scientific article |
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
