Robust constrained best approximation with nonconvex constraints
From MaRDI portal
Publication:2022294
Recommendations
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
Cites work
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- A Global Approach to Nonlinearly Constrained Best Approximation
- 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
- Characterizing best approximation from a convex set without convex representation
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Fenchel duality and the strong conical hull intersection property
- Generalizations of Slater's constraint qualification for infinite convex programs
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1235887 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- scientific article; zbMATH DE number 3399886 (Why is no real title available?)
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Lectures on Stochastic Programming
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
- On representations of the feasible set in convex optimization
- Robust optimization
- Theory and applications of robust optimization
Cited in
(5)- Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Best approximation with geometric constraints
This page was built for publication: Robust constrained best approximation with nonconvex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022294)
