Two logarithmic barrier methods for convex semi-infinite problems.
From MaRDI portal
Recommendations
- A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.
- A logarithm barrier method for semi-definite programming
- scientific article; zbMATH DE number 554512
- scientific article; zbMATH DE number 708836
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- scientific article; zbMATH DE number 1091399
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
- A relaxed logarithmic barrier method for semidefinite programming
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- A logarithmic barrier cutting plane method for convex programming
Cited in
(8)- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- Linear semi-infinite programming theory: an updated survey
- On controlling the parameter in the logarithmic barrier term for convex programming problems
- On some properties and an application of the logarithmic barrier method
- A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- scientific article; zbMATH DE number 708836 (Why is no real title available?)
- Smoothing by mollifiers. I: Semi-infinite optimization
This page was built for publication: Two logarithmic barrier methods for convex semi-infinite problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776652)
