Lagrange multiplier characterizations of constrained best approximation with infinite constraints
DOI10.1007/s10957-021-01856-5zbMath1475.90118OpenAlexW3158927446MaRDI QIDQ2046540
Hassan Bakhtiari, Hossein Mohebi
Publication date: 18 August 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01856-5
Lagrange multipliernonconvex constraintstrong conical hull intersection propertyconstrained best approximationperturbation propertyGuignard's constraint qualificationnear convexitysubdifferential closedness condition
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Best approximation, Chebyshev systems (41A50) Semi-infinite programming (90C34) Approximation with constraints (41A29)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Semi-infinite programming
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Convex analysis and nonlinear optimization. Theory and examples
- Characterizing best approximation from a convex set without convex representation
- Linear semi-infinite programming theory: an updated survey
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Necessary optimality conditions for a nonsmooth semi-infinite programming problem
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
- On duality theory of convex semi-infinite programming
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Variational Analysis and Applications
- Vector Variational Inequalities and 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
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- A Global Approach to Nonlinearly Constrained Best Approximation
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
- Nonlinear Programming
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
This page was built for publication: Lagrange multiplier characterizations of constrained best approximation with infinite constraints
