Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints
DOI10.2298/FIL2014669MzbMath1499.90176OpenAlexW3150460120MaRDI QIDQ5081362
Publication date: 14 June 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil2014669m
Lagrange multipliersconstraint qualificationstrong conical hull intersection propertyconstrained best approximationperturbation propertytangentially convex
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Best approximation, Chebyshev systems (41A50) Approximation with constraints (41A29)
Related Items (1)
Cites Work
- 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
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- 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
- 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
- A Global Approach to Nonlinearly Constrained Best Approximation
- Nonlinear Programming
- Best approximation in inner product spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints
