Linear Programming via a Nondifferentiable Penalty Function
From MaRDI portal
Publication:4099413
DOI10.1137/0713016zbMath0333.90029OpenAlexW2059899863MaRDI QIDQ4099413
Publication date: 1976
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0713016
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05)
Related Items
A simplex algorithm for piecewise-linear programming I: Derivation and proof, Piecewise-linear pathways to the optimal solution set in linear programming, Degeneracy in the presence of roundoff errors, A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy, Linear programming via least squares, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Piecewise-linear programming: The compact (CPLP) algorithm, Automatic decrease of the penalty parameter in exact penalty function methods, A penalty linear programming method using reduced-gradient basis-exchange techniques, A network penalty method, Solving linear programming problems via linear minimax problems, Large-scale linearly constrained optimization, A lower bound for the controlling parameters of the exact penalty functions
