Logarithmic SUMT limits in convex programming (Q5930727)
From MaRDI portal
scientific article; zbMATH DE number 1590537
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
