A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
From MaRDI portal
Publication:4292667
DOI10.1137/1036003zbMath0801.65056OpenAlexW1972223440MaRDI QIDQ4292667
Amr S. El-Bakry, Yin Zhang, Richard A. Tapia
Publication date: 18 May 1994
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/101719
convergencelinear programmingconstrained optimizationiterative methodindicator functioninterior-point methodsidentifying zero variables
Related Items
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming, A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming, A stable primal-dual approach for linear programming under nondegeneracy assumptions, Unnamed Item, Experimental investigations in combining primal dual interior point method and simplex based LP solvers, A primal-dual interior-point method for linear programming based on a weighted barrier function, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, Error bounds in mathematical programming, The spectral bundle method with second-order information, Solving real-world linear ordering problems using a primal-dual interior point cutting plane method, On the formulation and theory of the Newton interior-point method for nonlinear programming, Primal-dual methods for linear programming, Solving a class of LP problems with a primal-dual logarithmic barrier method, Fortran subroutines for network flow optimization using an interior point algorithm, On the accurate identification of active set for constrained minimax problems, Enhancing the behavior of interior-point methods via identification of variables, Symbolic implementation of interior point method for linear programming problem, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, On the convergence rate of Newton interior-point methods in the absence of strict complementarity, On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method, Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems, SICOpt: Solution approach for nonlinear integer stochastic programming problems, Interior-point methods, Degeneracy in interior point methods for linear programming: A survey, Primal-dual Newton-type interior-point method for topology optimization, Finding an interior point in the optimal face of linear programs, Active-set prediction for interior point methods using controlled perturbations
Uses Software
