Piecewise linear programming via interior points
type: Item
instance of: scholarly article
title: Piecewise linear programming via interior points
zbMATH Open document ID: 0971.90107
DOI: 10.1016/S0305-0548(99)00075-1
author: Mario Conrado Cavichia
author: Marcos N. Arenales
published in: Computers \& Operations Research
publication date: 2000-10-15T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 1517243
zbMATH Keywords: interior point algorithms
zbMATH Keywords: piecewise linear programming
zbMATH Keywords: computational experiments
MaRDI profile type: Publication
cites work: A new polynomial-time algorithm for linear programming
cites work: Search directions for interior linear-programming methods
cites work: A survey of search directions in interior point methods for linear programming
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: A unified view of interior point methods for linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming
cites work: A simplex algorithm for piecewise-linear programming I: Derivation and proof
cites work: A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
cites work: A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
cites work: Q3798476
cites work: Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
cites work: An Improved Algorithm for Discrete $l_1 $ Linear Approximation
cites work: A revised simplex algorithm for the absolute deviation curve fitting problem
cites work: Q4101610
Wikidata QID: Q126989469
full work available at URL: s0305-0548(99)00075-1
OpenAlex ID: W1973135350
description: scientific article; zbMATH DE number 1517243