Theorems of the alternative and duality
From MaRDI portal
Publication:1369042
DOI10.1023/A:1022644832111zbMath0892.90161OpenAlexW207684444MaRDI QIDQ1369042
Publication date: 7 October 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022644832111
optimality conditionsalignmentdegeneracytheorems of the alternativesteepest descent directionsmultifacility locationminimum norm dualitydiscrete \(l_1\)-approximation problemsleast norm problems
Related Items
Generalized isotone projection cones, Necessary and sufficient conditions for solving infinite-dimensional linear inequalities, Nonlinear programming via König's maximum theorem, A theorem of the alternative with an arbitrary number of inequalities and quadratic programming, Generalized projections onto convex sets, 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, The adventures of a simple algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new theorem of the alternative
- Linear programming via least squares
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
- On minimum norm solutions
- Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems
- Duality theorem for a generalized Fermat-Weber problem
- Algorithms for some minimax problems
- Solutions of overdetermined linear equations which minimize error in an abstract norm
- A quadratically convergent method for minimizing a sum of euclidean norms
- A note on solving multifacility location problems involving euclidean distances
- 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
- On Regularized Least Norm Problems
- An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem
- 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
- Classroom Note:An Elementary Proof of Farkas' Lemma
- A note on optimality conditions for the Euclidean. Multifacility location problem
- Duality Theorems and Theorems of the Alternative
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
