Pages that link to "Item:Q4308551"
From MaRDI portal
The following pages link to A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function (Q4308551):
Displaying 7 items.
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- Optimum dimensional synthesis of planar mechanisms with geometric constraints (Q2121228) (← links)
- (Q4358425) (← links)
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)