A Global Approach to Nonlinearly Constrained Best Approximation
From MaRDI portal
Recommendations
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- scientific article; zbMATH DE number 19423
- Constrained best approximation in Hilbert space. II
- Constrained best approximation in Hilbert space
- Uniform non-linear constrained approximation in normed linear spaces
Cites work
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- A simple closure condition for the normal cone intersection formula
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- 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
- Duality for optimization and best approximation over finite intersections
- Fenchel duality and the strong conical hull intersection property
- Fenchel duality in infinite-dimensional setting and its applications.
- Generalizations of Slater's constraint qualification for infinite convex programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- Inequality systems and global optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- 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 Projection Algorithms for Solving Convex Feasibility Problems
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
Cited in
(26)- Constrained best approximation in Hilbert space. II
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Characterizing best approximation from a convex set without convex representation
- Stable zero Lagrange duality for DC conic programming
- Robust constrained best approximation with nonconvex constraints
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- The strong conical hull intersection property for convex programming
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- On best-approximation problems for nonlinear operators
- Uniform non-linear constrained approximation in normed linear spaces
- scientific article; zbMATH DE number 4157190 (Why is no real title available?)
- scientific article; zbMATH DE number 3973502 (Why is no real title available?)
- scientific article; zbMATH DE number 19423 (Why is no real title available?)
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- scientific article; zbMATH DE number 3992091 (Why is no real title available?)
- scientific article; zbMATH DE number 4113211 (Why is no real title available?)
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints
- Best Approximation in a Class of Normed Spaces with Star-Shaped Cone
- Best approximation with geometric constraints
- Robust constrained best approximation in Banach spaces
- New qualification conditions for convex optimization without convex representation
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
This page was built for publication: A Global Approach to Nonlinearly Constrained Best Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462831)
