Pages that link to "Item:Q1262209"
From MaRDI portal
The following pages link to Linearly constrained estimation by mathematical programming (Q1262209):
Displaying 12 items.
- An application of Lipschitzian global optimization to product design (Q1200528) (← links)
- On the dual of linear inverse problems (Q1278264) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- An interior point algorithm for large scale portfolio optimization (Q1313173) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane (Q1342092) (← links)
- Pseudoconvex optimization for a special problem of paint industry (Q1342653) (← links)
- Inverse barriers and CES-functions in linear programming (Q1374380) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- On the duality of the mixed entropy programming (Q3835667) (← links)
- Semi-infinite programming duality for order restricted statistical inference models (Q4201812) (← links)
- A fifth bibliography of fractional programming<sup>*</sup> (Q4265528) (← links)
