Dealing with degeneracy in reduced gradient algorithms

DOI10.1007/BF02591957zbMath0573.90083OpenAlexW2055364975MaRDI QIDQ3691433

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 mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (8)

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 ⋮ Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods ⋮ The complex interior-boundary method for linear and nonlinear programming with linear constraints ⋮ Unnamed Item ⋮ A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties ⋮ A polynomial algorithm for minimum quadratic cost flow problems

Cites Work

• Unnamed Item
• Unnamed Item
• A Newton method for convex separable network flow problems
• The Constrained Gradient Method of Linear Programming
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• Conjugate gradient methods for linearly constrained nonlinear programming
• Large-scale linearly constrained optimization
• New Finite Pivoting Rules for the Simplex Method

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