Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
From MaRDI portal
Recommendations
- Robust constrained best approximation with nonconvex constraints
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
Cites work
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- A Global Approach to Nonlinearly Constrained Best Approximation
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
- Best approximation in inner product spaces
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Fenchel duality and the strong conical hull intersection property
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
Cited in
(8)- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- Robust constrained best approximation with nonconvex constraints
- Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Best approximation with geometric constraints
This page was built for publication: Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2414122)
