Pages that link to "Item:Q1123121"
From MaRDI portal
The following pages link to Interior path following primal-dual algorithms. I: Linear programming (Q1123121):
Displaying 50 items.
- An efficient fifth-order method for linear optimization (Q306315) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- Curvature integrals and iteration complexities in SDP and symmetric cone programs (Q404518) (← links)
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
- The \(Q\) method for symmetric cone programming (Q639204) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming (Q884611) (← links)
- Note on implementing the new sphere method for LP using matrix inversions sparingly (Q1001333) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating (Q1186945) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- Computing Karmarkar's projections in stochastic linear programming (Q1288215) (← links)
- A modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
- Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- A multiobjective interior primal-dual linear programming algorithm (Q1318462) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176) (← links)