Pages that link to "Item:Q688920"

The following pages link to On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920):

Displaying 13 items.

• An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
• Using central prices in the decomposition of linear programs (Q684317) (← links)
• Long-step interior-point algorithms for a class of variational inequalities with monotone operators (Q1264995) (← links)
• Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
• On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
• A cutting-plane method to nonsmooth multiobjective optimization problems (Q1719612) (← links)
• Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
• A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method (Q2046304) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• A path-following cutting plane method for some monotone variational inequalities^∗ (Q2709450) (← links)
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
• A \(J\)-symmetric quasi-Newton method for minimax problems (Q6120841) (← links)