Pages that link to "Item:Q3706829"
From MaRDI portal
The following pages link to A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem (Q3706829):
Displaying 8 items.
- Linear complementarity problems and multiple objective programming (Q689137) (← links)
- A constrained optimization approach to solving certain systems of convex equations (Q853007) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- Partially finite convex programming. II: Explicit lattice models (Q1198329) (← links)
- A finite improvement algorithm for the linear complementarity problem (Q1823161) (← links)
- A class of convergent generalized hill climbing algorithms (Q1855135) (← links)
- A descent approach to solving the complementary programming problem (Q3987784) (← links)
- The effectiveness of finite improvement algorithms for finding global optima (Q4201810) (← links)