A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.

MaRDI QIDQ3549490zbMATH OpenFDO

Authors Lars Abbe

Publication date 30 December 2008

Full work available at URL http://ubt.opus.hbz-nrw.de/volltexte/2004/105/index.html

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convex programming (90C25) Semi-infinite programming (90C34)

Recommendations

• Two logarithmic barrier methods for convex semi-infinite problems.
• Proximal interior point method for convex semi-infinite programming
• Proximal interior point approach in convex programming (ill-posed problems)^*†
• A regularized penalty method for solving convex semi-infinite programs
• scientific article; zbMATH DE number 108319

Cited in

(9)

• On controlling the parameter in the logarithmic barrier term for convex programming problems
• Two logarithmic barrier methods for convex semi-infinite problems.
• Proximal interior point method for convex semi-infinite programming
• A logarithm barrier method for semi-definite programming
• Proximal interior point approach in convex programming (ill-posed problems)^*†
• scientific article; zbMATH DE number 708836 (Why is no real title available?)
• Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity^*
• Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder).
• Solving continuous min-max problems by an iterative entropic regularization method.

This page was built for publication: A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549490)