Pages that link to "Item:Q1893461"

The following pages link to On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461):

Displaying 6 items.

• On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
• Controlled dual perturbations for central path trajectories in geometric programming (Q1328646) (← links)
• An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity^* (Q4888269) (← links)
• On using absolute norms, especially \(p\)-norms, to generate convex log barriers for constrained convex optimization (Q5048782) (← links)