Pages that link to "Item:Q4292667"

The following pages link to A Study of Indicators for Identifying Zero Variables in Interior-Point Methods (Q4292667):

Displayed 29 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) ‎ (← links)
• On the accurate identification of active set for constrained minimax problems (Q531696) ‎ (← links)
• A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) ‎ (← links)
• SICOpt: Solution approach for nonlinear integer stochastic programming problems (Q1039361) ‎ (← links)
• Solving a class of LP problems with a primal-dual logarithmic barrier method (Q1129972) ‎ (← links)
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) ‎ (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) ‎ (← links)
• Finding an interior point in the optimal face of linear programs (Q1319020) ‎ (← links)
• Error bounds in mathematical programming (Q1365060) ‎ (← links)
• Interior-point methods (Q1593831) ‎ (← links)
• On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) ‎ (← links)
• On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method (Q1816897) ‎ (← links)
• Primal-dual Newton-type interior-point method for topology optimization (Q1862194) ‎ (← links)
• Experimental investigations in combining primal dual interior point method and simplex based LP solvers (Q1904702) ‎ (← links)
• A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) ‎ (← links)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) ‎ (← links)
• On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) ‎ (← links)
• Primal-dual methods for linear programming (Q1924065) ‎ (← links)
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) ‎ (← links)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) ‎ (← links)
• A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming (Q2636608) ‎ (← links)
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) ‎ (← 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)
• The spectral bundle method with second-order information (Q2926057) ‎ (← links)
• Symbolic implementation of interior point method for linear programming problem (Q3056355) ‎ (← links)
• Fortran subroutines for network flow optimization using an interior point algorithm (Q4905605) ‎ (← links)
• (Q4953319) ‎ (← links)
• Enhancing the behavior of interior-point methods via identification of variables (Q5426974) ‎ (← links)