Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity*

DOI10.1080/02331939508844107zbMath0855.90099OpenAlexW2031513167MaRDI QIDQ4888269

Anthony V. Fiacco

Publication date: 28 July 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844107

zbMATH Keywords

barrier functionslevel set boundedness

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (2)

An infeasible interior-point algorithm for solving primal and dual geometric programs ⋮ Sensitivity and parametric bound analysis for a single pass machining problem

This page was built for publication: Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity^*