Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation (Q1751057)
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: Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation |
scientific article; zbMATH DE number 6871979
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation |
scientific article; zbMATH DE number 6871979 |
Statements
Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation (English)
0 references
23 May 2018
0 references
For minimizing a non-convex smooth function subject to linear equality constraints and non-negativity bounds, the author proposes an implemantation of the SPRGB method (stochastic perturbation of reduced gradient and bisection). Statements related to global convergence of the algorithm are presented as well as numerical results of large-scale problems.
0 references
large-scale problem
0 references
linear constraints
0 references
non-convex optimization
0 references
reduced gradient algorithm
0 references
bisection algorithm
0 references
stochastic perturbation
0 references
0 references
0 references
0 references
0 references
