Pages that link to "Item:Q1340070"

The following pages link to Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070):

Displaying 49 items.

• A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
• The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
• Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
• A modified infeasible-interior-point algorithm for linear optimization problems (Q493065) (← links)
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962) (← links)
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
• Convergence of the homotopy path for a full-Newton step infeasible interior-point method (Q969524) (← links)
• Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization (Q987511) (← links)
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
• A predictor-corrector infeasible-interior-point algorithm for linear programming (Q1342276) (← links)
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
• A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
• A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← 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)
• New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
• A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization (Q2016468) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
• Simplified infeasible interior-point algorithm for linear optimization based on a simple function (Q2294231) (← links)
• An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones (Q2361596) (← links)
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
• An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
• The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
• A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils (Q2666658) (← links)
• Estimating the probability that a given vector is in the convex hull of a random sample (Q2689428) (← links)
• An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem (Q2808306) (← links)
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function (Q2810097) (← links)
• A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION (Q2873836) (← links)
• An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization (Q2883644) (← links)
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
• A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← 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 interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step (Q4635027) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• A new class of infeasible interior-point algorithm for linear complementarity problem (Q5400131) (← links)
• Design of continuous-time recurrent neural networks with piecewise-linear activation function for generation of prescribed sequences of bipolar vectors (Q6057957) (← links)