Pages that link to "Item:Q687084"
From MaRDI portal
The following pages link to A scaling technique for finding the weighted analytic center of a polytope (Q687084):
Displaying 14 items.
- Sufficient weighted complementarity problems (Q288407) (← links)
- A weighted projection centering method (Q539647) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- Long-step interior-point algorithms for a class of variational inequalities with monotone operators (Q1264995) (← links)
- A new characterization of the center of a polytope (Q1384160) (← links)
- A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← 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)
- Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method (Q2337073) (← links)
- A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils (Q2666658) (← links)
- Computing the weight distribution of a set of points obtained by scaling, shifting, and truncating a lattice (Q4859773) (← links)
- Interior-point algorithms for a generalization of linear programming and weighted centring (Q5200552) (← links)
