A Global Approach to Nonlinearly Constrained Best Approximation
From MaRDI portal
Publication:5462831
DOI10.1081/NFA-200063880zbMath1072.41019OpenAlexW2050054458MaRDI QIDQ5462831
Hossein Mohebi, Vaithilingam Jeyakumar
Publication date: 27 July 2005
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/nfa-200063880
bounded linear regularitySlater's conditionstrong conical hull intersection propertybest constrained approximationglobal conditionscone-convex constraintsdual constraint qualifications
Nonlinear programming (90C30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)
Related Items
New qualification conditions for convex optimization without convex representation ⋮ Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints ⋮ Characterizing nonconvex constrained best approximation using Robinson's constraint qualification ⋮ 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 ⋮ Stable zero Lagrange duality for DC conic programming ⋮ Characterizing best approximation from a convex set without convex representation ⋮ The strong conical hull intersection property for convex programming ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite 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 ⋮ Best Approximation in a Class of Normed Spaces with Star-Shaped Cone ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
Cites Work
- Unnamed Item
- Generalizations of Slater's constraint qualification for infinite convex programs
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Fenchel duality in infinite-dimensional setting and its applications.
- 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
- Duality for optimization and best approximation over finite intersections
- 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
- On Projection Algorithms for Solving Convex Feasibility Problems
- 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
- On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
- 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
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Best approximation in inner product spaces
