A simple constraint qualification in infinite dimensional programming
From MaRDI portal
Publication:3731366
DOI10.1007/BF01589443zbMath0597.90056OpenAlexW1999138341WikidataQ56935986 ScholiaQ56935986MaRDI QIDQ3731366
Henry Wolkowicz, Jonathan M. Borwein
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01589443
equality constraintsduality theoremsSlater's conditioninfinite dimensional linear programming\(L_ 2\)- approximationconstant qualification
Related Items
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems, Facial reduction in partially finite convex programming, Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation, On conic QPCCs, conic QCQPs and completely positive programs, Gradient methods and conic least-squares problems, A nonlinear equation for linear programming, Liberating the subgradient optimality conditions from constraint qualifications, Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications, Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance, 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, A simple closure condition for the normal cone intersection formula, On constraint qualifications in nonsmooth optimization., Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior, A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds, Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
