Newton's method for optimization problems with a convex smooth surface as a constraint (Q2901142)
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: Newton's method for optimization problems with a convex smooth surface as a constraint |
scientific article; zbMATH DE number 6057657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Newton's method for optimization problems with a convex smooth surface as a constraint |
scientific article; zbMATH DE number 6057657 |
Statements
16 July 2012
0 references
convex smooth surface
0 references
tangential hyperplane
0 references
second derivative matrix
0 references
local minimum conditions
0 references
Newton's method
0 references
convergence of algorithm
0 references
Newton's method for optimization problems with a convex smooth surface as a constraint (English)
0 references
As a generalized Newton method for optimization problems with a convex smooth surface as a constraint, an iteration algorithm is constructed and convergence is proved at various choices of iteration steps.
0 references
0.8327770829200745
0 references
0.8317824602127075
0 references
0.8294076919555664
0 references
