A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
From MaRDI portal
Publication:4292667
Recommendations
- On the Identification of Zero Variables in an Interior-Point Framework
- Enhancing the behavior of interior-point methods via identification of variables
- On free variables in interior point methods
- An extension for identifying search directions for interior-point methods in linear optimization
- An interior point method for nonlinear programming with infeasibility detection capabilities
- Insights into the interior-point methods
- An optimal-basis identification technique for interior-point linear programming algorithms
- The interior point method for nondifferentiable optimization
- Detecting infeasibility in infeasible-interior-point methods for optimization
- scientific article; zbMATH DE number 1008715
Cited in
(32)- SICOpt: Solution approach for nonlinear integer stochastic programming problems
- Solving a class of LP problems with a primal-dual logarithmic barrier method
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Degeneracy in interior point methods for linear programming: A survey
- Finding an interior point in the optimal face of linear programs
- Error bounds in mathematical programming
- Interior-point methods
- 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
- Primal-dual Newton-type interior-point method for topology optimization
- 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
- 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
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Active-set prediction for interior point methods using controlled perturbations
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- 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
- The spectral bundle method with second-order information
- Symbolic implementation of interior point method for linear programming problem
- On the Identification of Zero Variables in an Interior-Point Framework
- scientific article; zbMATH DE number 953027 (Why is no real title available?)
- Using Indicators in Finite Termination Procedures
- Fortran subroutines for network flow optimization using an interior point algorithm
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- On the accurate identification of active set for constrained minimax problems
- Enhancing the behavior of interior-point methods via identification of variables
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
This page was built for publication: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4292667)
