Logarithmic SUMT limits in convex programming (Q5930727)
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 1590537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logarithmic SUMT limits in convex programming |
scientific article; zbMATH DE number 1590537 |
Statements
Logarithmic SUMT limits in convex programming (English)
0 references
22 May 2002
0 references
The authors give a comprehensive overview of the theory of sequential unconstrained minimization techniques (SUMT) with a logarithmic barrier function. Moreover some gaps in the theory are closed. Fully worked out examples are given to illustrate especially the convergence of SUMT-trajectories to an optimal point.
0 references
logarithmic barrier function
0 references
interior point method
0 references
sequential unconstrained minimization
0 references
SUMT
0 references
0.8147415518760681
0 references
0.8023061156272888
0 references
0.7803043723106384
0 references
0.7785809636116028
0 references
