A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657)
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: A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization |
scientific article; zbMATH DE number 6395517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization |
scientific article; zbMATH DE number 6395517 |
Statements
A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (English)
0 references
3 February 2015
0 references
inequality constraints
0 references
optimization
0 references
QP-free algorithm
0 references
method of quasi-strongly sub-feasible directions
0 references
working set
0 references
global and strong convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8930017948150635
0 references
0.875947892665863
0 references
0.8622879385948181
0 references
0.8608133792877197
0 references
