Pages that link to "Item:Q329787"
From MaRDI portal
The following pages link to A logarithmic barrier approach for linear programming (Q329787):
Displaying 16 items.
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming (Q806962) (← links)
- Solving a class of LP problems with a primal-dual logarithmic barrier method (Q1129972) (← links)
- Rank-one techniques in log-barrier function methods for linear programming (Q1333365) (← links)
- The role of linear objective functions in barrier methods (Q1572683) (← links)
- On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming (Q2174912) (← links)
- Logarithmic barrier method via minorant function for linear semidefinite programming (Q2693233) (← links)
- (Q3504911) (← links)
- A logarithm barrier method for semi-definite programming (Q3539804) (← links)
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming (Q4646557) (← links)
- Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming (Q4834254) (← links)
- Inverse barrier methods for linear programming (Q4887125) (← links)
- ADAPTATION OF THE MINORANT FUNCTION FOR LINEAR PROGRAMMING (Q5213047) (← links)
- Logarithmic Barrier Method Via Minorant Function for Linear Programming (Q5853371) (← links)
- An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851) (← links)
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP (Q6667371) (← links)
