The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
From MaRDI portal
Publication:1312749
DOI10.1007/BF02096256zbMath0786.90063MaRDI QIDQ1312749
Publication date: 7 February 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
surveyoptimality conditionssubdifferentialnondifferentiable minimizationsteepest descent directionmultifacility location problemsdegeneracy in active set methodsdiscrete \(l_ 1\) approximation
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (9)
Duality theorem for a generalized Fermat-Weber problem ⋮ Theorems of the alternative and duality ⋮ Condensation and metastable behavior of non-reversible inclusion processes ⋮ A new class of theorems of the alternative ⋮ A new proof of the Kuhn-Tucker and Farkas theorems ⋮ The \(\ell_1\) solution of linear inequalities ⋮ A simple algebraic proof of Farkas's lemma and related theorems ⋮ The distance between two convex sets ⋮ Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
Cites Work
- A new theorem of the alternative
- Linear programming via least squares
- Theorems of the alternative and optimality conditions
- Algorithms for some minimax problems
- A numerically stable form of the simplex algorithm
- A quadratically convergent method for minimizing a sum of euclidean norms
- Discrete l1 Approximation by Rational Functions
- A note on solving multifacility location problems involving euclidean distances
- Successive Refinement of Large Multicell Models
- An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem
- An algorithm for non-negative norm minimal solutions
- A projected newton method forl p norm location problems
- The $l_1 $ Solution of Linear Equations Subject to Linear Constraints
- The Minimax Solution of Linear Equations Subject to Linear Constraints
- Solving multifacility location problems involving euclidean distances
- Linearly Constrained Discrete I 1 Problems
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- On Regularized Least Norm Problems
- A Descent Method for the Uniform Solution to Over-Determined Systems of Linear Equations
- An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem
- Finding the nearest point in A polytope
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense
- On computational aspects of bounded linear least squares problems
- Finding the Point of a Polyhedron Closest to the Origin
- A note on optimality conditions for the Euclidean. Multifacility location problem
- Convex Analysis
- A Note on Motzkin's Transposition Theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
