Pages that link to "Item:Q4764308"

The following pages link to Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming (Q4764308):

Displaying 43 items.

• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
• An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
• Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
• Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
• A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909) (← links)
• A note on a potential reduction algorithm for LP with simultaneous primal-dual updating (Q1186945) (← links)
• A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
• Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
• Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
• An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
• Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
• A predictor-corrector infeasible-interior-point algorithm for linear programming (Q1342276) (← links)
• Potential-reduction methods in mathematical programming (Q1361104) (← links)
• An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
• Linear programming with stochastic elements: An on-line approach (Q1368447) (← links)
• Deriving potential functions via a symmetry principle for nonlinear equations (Q1375121) (← links)
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
• A constant-potential infeasible-start interior-point algorithm with computational experiments and applications (Q1383829) (← links)
• Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
• Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
• An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
• An infeasible-interior-point potential-reduction algorithm for linear programming (Q1961981) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
• A still simpler way of introducing interior-point method for linear programming (Q2374256) (← links)
• On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
• Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions (Q2412702) (← links)
• Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035) (← links)
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486) (← links)
• Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)
• A primal-dual variant of the Iri-Imai algorithm for linear programming (Q2757631) (← links)
• A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659) (← links)
• Interior-point methods for linear programming: a review (Q3150491) (← links)
• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
• (Q4545873) (← links)
• Achievable potential reductions in the method of Kojima et al. in the case of linear programming (Q4887124) (← links)
• Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)
• A potential-reduction algorithm for linear complementarity problems (Q5697858) (← links)