A penalty linear programming method using reduced-gradient basis-exchange techniques
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3363343 (Why is no real title available?)
- A mathematical programming updating method using modified Givens transformations and applied to LP problems
- Linear Programming via a Nondifferentiable Penalty Function
- Linearly Constrained Discrete I 1 Problems
- Minimization Techniques for Piecewise Differentiable Functions: The l₁ Solution to an Overdetermined Linear System
Cited in
(11)- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Degeneracy in the presence of roundoff errors
- Linear programming via least squares
- A network penalty method
- Piecewise-linear pathways to the optimal solution set in linear programming
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- Procedures for optimization problems with a mixture of bounds and general linear constraints
- A method of synthesis of linear discriminant function in the case of nonseparability
- Solving linear programming problems via linear minimax problems
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Automatic decrease of the penalty parameter in exact penalty function methods
This page was built for publication: A penalty linear programming method using reduced-gradient basis-exchange techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138478)