Linear Programming via a Nondifferentiable Penalty Function

DOI10.1137/0713016MaRDI QIDQ4099413zbMATH OpenOpenAlexFDO

Authors Andrew R. Conn

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30)

Cited in

(13)

• 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
• A lower bound for the controlling parameters of the exact penalty functions
• Large-scale linearly constrained optimization
• 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
• A penalty linear programming method using reduced-gradient basis-exchange techniques
• Piecewise-linear programming: The compact (CPLP) algorithm

This page was built for publication: Linear Programming via a Nondifferentiable Penalty Function

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