Piecewise-linear pathways to the optimal solution set in linear programming
type: Item
instance of: scholarly article
title: Piecewise-linear pathways to the optimal solution set in linear programming
zbMATH Open document ID: 0873.90066
DOI: 10.1023/A:1022651331550
author: O. Diekmann
published in: Journal of Optimization Theory and Applications
publication date: 1997-07-07T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 1019668
zbMATH Keywords: piecewise-linear path-following algorithms
zbMATH Keywords: quadratic penalty functions
zbMATH Keywords: continuation algorithm
zbMATH Keywords: finite penalty algorithm
zbMATH Keywords: least-norm algorithm
describes a project that uses: AAFAC
describes a project that uses: LSSOL
MaRDI profile type: Publication
cites work: A New Finite Continuation Algorithm for Linear Programming
cites work: Normal solutions of linear programs
cites work: A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
cites work: Finite algorithms for robust linear regression
cites work: Necessary and sufficient conditions for a penalty method to be exact
cites work: Nonlinear Perturbation of Linear Programs
cites work: Gauss-Seidel method for least-distance problems
cites work: The Linear l1 Estimator and the Huber M-Estimator
cites work: Duality results and proximal solutions of the Huber \(M\)-estimator problem
cites work: A penalty linear programming method using reduced-gradient basis-exchange techniques
cites work: Linear Programming via a Nondifferentiable Penalty Function
cites work: Variation of the penalty coefficient in linear programming problems
cites work: Finite Algorithms for Huber’sM-Estimator
cites work: Linear programming via least squares
cites work: Q4331898
cites work: Q3688092
full work available at URL: a:1022651331550
OpenAlex ID: W198845011
description: scientific article; zbMATH DE number 1019668