Robust constrained best approximation with nonconvex constraints

DOI10.1007/S10898-020-00957-1zbMATH Open1462.41008OpenAlexW3091832587MaRDI QIDQ2022294FDOQ2022294

H. Mohebi, S. Salkhordeh

Publication date: 28 April 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00957-1

zbMATH Keywords

Lagrange multipliersstrong conical hull intersection propertyperturbation propertyrobust best approximationrobust constrained best approximationrobust nondegeneracy constraint qualificationrobust Slater's constraint qualification

Mathematics Subject Classification ID

Convex programming (90C25) Semidefinite programming (90C22) Best approximation, Chebyshev systems (41A50) Approximation with constraints (41A29)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex analysis and monotone operator theory in Hilbert spaces
• Theory and Applications of Robust Optimization
• Lectures on Stochastic Programming
• Best approximation in inner product spaces
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Generalizations of Slater's constraint qualification for infinite convex programs
• Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
• Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
• Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• Fenchel duality and the strong conical hull intersection property
• 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
• On representations of the feasible set in convex optimization
• Characterizing best approximation from a convex set without convex representation
• On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
• Necessary and sufficient KKT optimality conditions in non-convex optimization

Cited In (1)

• Best approximation with geometric constraints

This page was built for publication: Robust constrained best approximation with nonconvex constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022294)