A simple constraint qualification in infinite dimensional programming
From MaRDI portal
Publication:3731366
DOI10.1007/BF01589443zbMath0597.90056WikidataQ56935986 ScholiaQ56935986MaRDI QIDQ3731366
Jonathan M. Borwein, Henry Wolkowicz
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
equality constraints; duality theorems; Slater's condition; infinite dimensional linear programming; \(L_ 2\)- approximation; constant qualification
Related Items
A simple closure condition for the normal cone intersection formula, Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior, On constraint qualifications in nonsmooth optimization., Liberating the subgradient optimality conditions from constraint qualifications, Partially finite convex programming. II: Explicit lattice models, Generalizations of Slater's constraint qualification for infinite convex programs, Constrained best approximation in Hilbert space. II, Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds, Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems, Facial reduction in partially finite convex programming, A nonlinear equation for linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained \(L_ p\) approximation
- Some applications of optimization in matrix theory
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Characterizations of optimality without constraint qualification for the abstract convex program
- Generalizations of Farkas’ Theorem
- Linear Programming in Reflexive Spaces
