The following pages link to (Q3827797):
Displayed 12 items.
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- An \(\epsilon\)-active barrier-function method for solving minimax problems (Q806678) (← links)
- Applications of the notion of analytic center in approximation (estimation) problems (Q912570) (← links)
- A barrier function method for minimax problems (Q1186276) (← links)
- Interior-point methods for convex programming (Q1205507) (← links)
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- An interior-point method for semi-infinite programming problems (Q1915915) (← links)
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) (← links)
- On the convergence of the method of analytic centers when applied to convex quadratic programs (Q2277366) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)