A practical anti-cycling procedure for linearly constrained optimization
From MaRDI portal
DOI10.1007/BF01589114zbMATH Open0688.90038OpenAlexW1977310057MaRDI QIDQ1264089FDOQ1264089
Philip E. Gill, Margaret H. Wright, Walter Murray, Michael A. Saunders
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01589114
Recommendations
degeneracysimplex methodactive-set methodsanti-cycling proceduregeneral linearly constrained problems
Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30)
Cites Work
- Implementation aids for optimization algorithms that solve sequences of linear programs
- Numerically stable methods for quadratic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pivot selection methods of the Devex LP code
- Title not available (Why is that?)
- Evolution of linear programming computing techniques
- Title not available (Why is that?)
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- New Finite Pivoting Rules for the Simplex Method
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Title not available (Why is that?)
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- On the integer properties of scheduling set partitioning models
- On the solution of highly degenerate linear programmes
- A Technique for Resolving Degeneracy in Linear Programming
- Title not available (Why is that?)
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- An analysis of an available set of linear programming test problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On practical stopping rules for the simplex method
- The Composite Simplex Algorithm
- A complete constructive algorithm for the general mixed linear programming problem
- Making progress during a stall in the simplex algorithm
Cited In (53)
- Numerical approximation of Dynkin games with asymmetric information
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- Linearly constrained global optimization: a general solution algorithm with applications.
- Limit cycles in local preference optimization
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
- Parametric linear programming and anti-cycling pivoting rules
- Feasibility issues in a primal-dual interior-point method for linear programming
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
- Systematic construction of examples for cycling in the simplex method
- A practical anti-degeneracy row selection technique in network linear programming
- Resolving degeneracy in quadratic programming
- A two-phase support method for solving linear programs: numerical experiments
- Complementarity framework for non linear dynamic analysis of skeletal structures with softening plastic hinges
- Parallel search paths for the simplex algorithm
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- An affine-scaling pivot algorithm for linear programming
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- A strictly improving linear programming Phase I algorithm
- Primal and dual active-set methods for convex quadratic programming
- A linear programming decomposition focusing on the span of the nondegenerate columns
- LPAKO: A Simplex-based Linear Programming Program
- On the use of dense matrix techniques within sparse simplex
- An efficient linear programming algorithm for combined heat and power production.
- Degeneracy graphs: Theory and applications. An updated survey
- An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Title not available (Why is that?)
- New crash procedures for large systems of linear constraints
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis.
- The positive edge pricing rule for the dual simplex
- Pivot rules for linear programming: A survey on recent theoretical developments
- Efficient implementation of an active set algorithm for large-scale portfolio selection
- Towards a practical parallelisation of the simplex method
- On degeneracy in linear programming and related problems
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- An efficient linear model and optimisation algorithm for multi-site combined heat and power production
- Fast quantum subroutines for the simplex method
- A phase-1 approach for the generalized simplex algorithm
- A basis-defiency-allowing variation of the simplex method for linear programming
- Advances in design and implementation of optimization software
- Cycling in linear programming problems
- A validation and verification tool for global optimization solvers
- Methods for convex and general quadratic programming
- The simplex algorithm with a new primal and dual pivot rule
- A primal deficient-basis simplex algorithm for linear programming
- A factorization with update procedures for a KKT matrix arising in direct optimal control
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm
- Pivot versus interior point methods: Pros and cons
- Geometry of the Gass-Saaty parametric cost LP algorithm
- Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision
- Title not available (Why is that?)
Uses Software
This page was built for publication: A practical anti-cycling procedure for linearly constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264089)
