Normal solutions of linear programs

DOI10.1007/BFB0121017zbMath0588.90058OpenAlexW2059448930MaRDI QIDQ3716811

Olvi L. Mangasarian

Publication date: 1984

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121017

zbMATH Keywords

exact solutionapproximate solutionnormal solutioncomputational resultscomparison of algorithmsrevised simplexleast norm property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Linear programming (90C05)

Related Items (25)

Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs ⋮ Linear programming with nonparametric penalty programs and iterated thresholding ⋮ Introduction: New approaches to linear programming ⋮ A new result in the theory and computation of the least-norm solution of a linear program ⋮ A nonlinear equation for linear programming ⋮ Finding normal solutions in piecewise linear programming ⋮ Insoluble multicriteria linear programming problems ⋮ Piecewise-linear pathways to the optimal solution set in linear programming ⋮ Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs ⋮ Iterative schemes for the least 2-norm solution of piecewise linear programs ⋮ A Gauss-Newton method for convex composite optimization ⋮ Algorithms for bound constrained quadratic programming problems ⋮ The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case ⋮ A finite algorithm for the least two-norm solution of a linear program¹ ⋮ On the minimum norm solution of linear programs ⋮ A conjugate gradient algorithm for sparse linear inequalities ⋮ Finite termination of the proximal point algorithm ⋮ Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs ⋮ A Newton method for linear programming ⋮ A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs ⋮ Newton's method for linear inequality systems ⋮ A global error bound for quadratic perturbation of linear programs ⋮ Finite perturbation of convex programs ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms ⋮ Unnamed Item

This page was built for publication: Normal solutions of linear programs