Pages that link to "Item:Q1744997"
From MaRDI portal
The following pages link to A variant of the dual simplex method for a linear semidefinite programming problem (Q1744997):
Displaying 11 items.
- On convergence of the dual Newton method for a linear semidefinite programming problem (Q447684) (← links)
- A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem (Q519124) (← links)
- A Lagrangean dual-based solution method for a special linear programming problem (Q581236) (← links)
- Direct Newton method for a linear problem of semidefinite programming (Q735655) (← links)
- Two-phase simplex method for linear semidefinite optimization (Q2010151) (← links)
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
- A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
- Dual interior point methods for linear semidefinite programming problems (Q2901126) (← links)
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems (Q3813167) (← links)
- Efficiency of the dual simplex method for solving systems of linear inequalities (Q4005338) (← links)
- A Variant of the Dual Pivoting Rule in Linear Programming (Q4321114) (← links)
