The following pages link to (Q5309541):
Displayed 12 items.
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem (Q376771) (← links)
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming (Q2174912) (← links)
- A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← links)
- A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP (Q2263027) (← links)
- Complexity analysis of a weighted-full-Newton step interior-point algorithm for<i>P</i><sub>∗</sub>(<i>κ</i>)-LCP (Q2798122) (← links)
- (Q4604968) (← links)
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming (Q4646557) (← links)
- A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems (Q5043856) (← links)
- A polynomial-time weighted path-following interior-point algorithm for linear optimization (Q5221008) (← links)