The following pages link to (Q3995706):
Displaying 17 items.
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Interior-point methods for convex programming (Q1205507) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- Interior-point algorithm for quadratically constrained entropy minimization problems (Q1321322) (← links)
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- On the choice of parameters for power-series interior point algorithms in linear programming (Q1804368) (← links)
- Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
- On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
- An interior-point method for semi-infinite programming problems (Q1915915) (← links)
- The Newton modified barrier method for QP problems (Q1915923) (← links)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
- A path following algorithm for a class of convex programming problems (Q4016864) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)
