Lagrange multiplier characterizations of constrained best approximation with infinite constraints
From MaRDI portal
Publication:2046540
Recommendations
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- 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
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- A Global Approach to Nonlinearly Constrained Best Approximation
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- 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
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Constraint qualifications for semi-infinite systems of convex inequalities
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis and nonlinear optimization. Theory and examples
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2156769 (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?)
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Linear semi-infinite programming theory: an updated survey
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Necessary optimality conditions for a nonsmooth semi-infinite programming problem
- Nonlinear Programming
- 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 Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- On duality theory of convex semi-infinite programming
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- Semi-infinite programming
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Variational analysis and applications
- Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
- Vector variational inequalities and vector optimization. Theory and applications
Cited in
(7)- Robust constrained best approximation with nonconvex constraints
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Best approximation with geometric constraints
- A duality-guided proximal splitting method for robust constrained best approximation via convex semi-definite program reformulations
This page was built for publication: Lagrange multiplier characterizations of constrained best approximation with infinite constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046540)
