Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960)
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: Constrained optimization with integer and continuous variables using inexact restoration and projected gradients |
scientific article; zbMATH DE number 6914259
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constrained optimization with integer and continuous variables using inexact restoration and projected gradients |
scientific article; zbMATH DE number 6914259 |
Statements
Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (English)
0 references
7 August 2018
0 references
Summary: Inexact restoration (IR) is a well established technique for continuous minimization problems with constraints that can be applied to constrained optimization problems with specific structures. When some variables are restricted to be integer, an IR strategy seems to be appropriate. The IR strategy employs a restoration procedure in which one solves a standard nonlinear programming problem and an optimization procedure in which the constraints are linearized and techniques for mixed-integer (linear or quadratic) programming can be employed.
0 references
inexact restoration
0 references
mixed-integer nonlinear programming (MINLP)
0 references
projected gradients
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references