Dealing with degeneracy in reduced gradient algorithms

DOI10.1007/BF02591957MaRDI QIDQ3691433zbMATH OpenOpenAlexFDO

Authors Ron S. Dembo, John G. Klincewicz

Publication date 1985

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02591957

zbMATH Keywords

degeneracylinearly constrained optimizationreduced gradient methods

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 123740
• A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming
• scientific article; zbMATH DE number 3948008
• Publication:4727306
• scientific article; zbMATH DE number 4202038
• scientific article; zbMATH DE number 3930257
• Applying a reduced gradient in quadratic programming
• A reduced subgradient algorithm
• Shrinking generalized gradients
• A Deflated Version of the Conjugate Gradient Algorithm

Cites work

• A Newton method for convex separable network flow problems
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• Conjugate gradient methods for linearly constrained nonlinear programming
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3402374 (Why is no real title available?)
• Large-scale linearly constrained optimization
• New Finite Pivoting Rules for the Simplex Method
• The Constrained Gradient Method of Linear Programming

Cited in

(17)

• A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
• On degeneracy in linear programming and related problems
• A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming
• A smooth penalty function algorithm for network-structured problems
• Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation
• A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties
• Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization
• scientific article; zbMATH DE number 5899260 (Why is no real title available?)
• A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
• Reduced gradient computation in prediction error identification
• scientific article; zbMATH DE number 13594 (Why is no real title available?)
• scientific article; zbMATH DE number 123740 (Why is no real title available?)
• Approximating reduced costs under degeneracy in a network flow problem with side constraints
• New crash procedures for large systems of linear constraints
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
• A polynomial algorithm for minimum quadratic cost flow problems
• The complex interior-boundary method for linear and nonlinear programming with linear constraints

This page was built for publication: Dealing with degeneracy in reduced gradient algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691433)