Pages that link to "Item:Q4888269"
From MaRDI portal
The following pages link to Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity<sup>*</sup> (Q4888269):
Displaying 4 items.
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- Sensitivity and parametric bound analysis for a single pass machining problem (Q1804065) (← links)
- Two properties of condition numbers for convex programs via implicitly defined barrier functions (Q1849258) (← links)
- On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)