Pages that link to "Item:Q3691433"
From MaRDI portal
The following pages link to Dealing with degeneracy in reduced gradient algorithms (Q3691433):
Displaying 17 items.
- New crash procedures for large systems of linear constraints (Q584077) (← links)
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary (Q1106721) (← links)
- On degeneracy in linear programming and related problems (Q1312772) (← links)
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming (Q1327826) (← links)
- A smooth penalty function algorithm for network-structured problems (Q1388940) (← links)
- Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation (Q1751057) (← links)
- A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties (Q1813345) (← links)
- Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization (Q2250064) (← links)
- (Q3002784) (← links)
- A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy (Q3474495) (← links)
- Reduced gradient computation in prediction error identification (Q3679093) (← links)
- A quadratic programming algorithm for large and sparse problems (Q3978055) (← links)
- (Q4025413) (← links)
- Approximating reduced costs under degeneracy in a network flow problem with side constraints (Q5689761) (← links)
