A new linesearch method for quadratically constrained convex programming (Q1342277)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 710263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new linesearch method for quadratically constrained convex programming |
scientific article; zbMATH DE number 710263 |
Statements
A new linesearch method for quadratically constrained convex programming (English)
0 references
17 January 1996
0 references
linesearch
0 references
step optimization
0 references
interior point methods
0 references
quadratic objective function
0 references
quadratic constraints
0 references
transformed derivative
0 references
improved Newton method
0 references
0 references
0.8263222575187683
0 references
0.811275064945221
0 references
0.8045883774757385
0 references
0.7971782088279724
0 references
