Pages that link to "Item:Q1327215"

The following pages link to Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215):

Displayed 12 items.

• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) ‎ (← links)
• Optimal joint pricing and lot sizing with fixed and variable capacity (Q1296710) ‎ (← links)
• Complexity of some cutting plane methods that use analytic centers (Q1352301) ‎ (← links)
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) ‎ (← links)
• An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) ‎ (← links)
• An accelerated central cutting plane algorithm for linear semi-infinite programming (Q1764241) ‎ (← links)
• A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) ‎ (← links)
• A logarithmic barrier cutting plane method for convex programming (Q1904709) ‎ (← links)
• A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) ‎ (← links)
• A cutting plane method from analytic centers for stochastic programming (Q1922690) ‎ (← links)
• Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) ‎ (← links)
• Homogeneous analytic center cutting plane methods with approximate centers (Q4504783) ‎ (← links)