Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
From MaRDI portal
Publication:2566244
DOI10.1016/j.jat.2005.04.004zbMath1138.41304MaRDI QIDQ2566244
Vaithilingam Jeyakumar, Hossein Mohebi
Publication date: 22 September 2005
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2005.04.004
Hilbert spaces; strong conical hull intersection property; constrained best approximation; \(\varepsilon\)-subgradients; limiting dual conditions
Related Items
Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency, Best Approximation in a Class of Normed Spaces with Star-Shaped Cone, Total Lagrange duality for DC infinite optimization problems, Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty, Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization, Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming, Stable zero Lagrange duality for DC conic programming, Constraint qualifications characterizing Lagrangian duality in convex optimization, Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
Cites Work
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Fenchel duality and the strong conical hull intersection property
- Inequality systems and global optimization
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- A simple closure condition for the normal cone intersection formula
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- 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
- A Global Approach to Nonlinearly Constrained Best Approximation
- Best approximation in inner product spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
