A simple constraint qualification in infinite dimensional programming
From MaRDI portal
Recommendations
- Constraint qualification with Schauder basis for infinite programming problems
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- Constraint qualifications and Farkas lemma in convex infinite programming
- scientific article; zbMATH DE number 2158983
- A simple constraint qualification in convex programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Constraint qualifications in linear vector semi-infinite optimization
- New Farkas-type constraint qualifications in convex infinite programming
- Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programming problems
Cites work
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- scientific article; zbMATH DE number 3737415 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- Characterizations of optimality without constraint qualification for the abstract convex program
- Constrained \(L_ p\) approximation
- Generalizations of Farkas’ Theorem
- Linear Programming in Reflexive Spaces
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Some applications of optimization in matrix theory
Cited in
(23)- Error bounds and multipliers in constrained optimization problems with tolerance
- scientific article; zbMATH DE number 7293696 (Why is no real title available?)
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Constrained best approximation in Hilbert space. II
- On conic QPCCs, conic QCQPs and completely positive programs
- A Dual Approach to Multidimensional L_p Spectral Estimation Problems
- Gradient methods and conic least-squares problems
- A simple closure condition for the normal cone intersection formula
- On constraint qualifications in nonsmooth optimization.
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Generalizations of Slater's constraint qualification for infinite convex programs
- Partially finite convex programming. II: Explicit lattice models
- scientific article; zbMATH DE number 124729 (Why is no real title available?)
- scientific article; zbMATH DE number 3939125 (Why is no real title available?)
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- On duality theory in vector spaces without topology via algebraic core
- A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds
- Smooth and semismooth Newton methods for constrained approximation and estimation
- Facial reduction in partially finite convex programming
- Constraint qualification with Schauder basis for infinite programming problems
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- A nonlinear equation for linear programming
- Liberating the subgradient optimality conditions from constraint qualifications
This page was built for publication: A simple constraint qualification in infinite dimensional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731366)
