Pages that link to "Item:Q5853250"
From MaRDI portal
The following pages link to Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming (Q5853250):
Displaying 9 items.
- Two logarithmic barrier methods for convex semi-infinite problems. (Q2776652) (← links)
- A logarithm barrier method for semi-definite programming (Q3539804) (← links)
- A new barrier for a class of semidefinite problems (Q3635704) (← links)
- (Q5029788) (← links)
- ADAPTATION OF THE MINORANT FUNCTION FOR LINEAR PROGRAMMING (Q5213047) (← links)
- On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs (Q5453573) (← 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)