On calculating the normal cone to a finite union of convex polyhedra†
From MaRDI portal
Publication:5449011
DOI10.1080/02331930701778874zbMath1220.52001OpenAlexW2107637091MaRDI QIDQ5449011
Publication date: 10 March 2008
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701778874
Set-valued and variational analysis (49J53) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Optimality conditions for sparse nonlinear programming, Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets, Optimality conditions for nonsmooth multiobjective bilevel optimization problems, The intermediate set and limiting superdifferential for coalitional games: between the core and the Weber set, Jiří V. Outrata, sailing analyst, becomes sixty, Exact formulae for coderivatives of normal cone mappings to perturbed polyhedral convex sets, Coderivatives related to parametric extended trust region subproblem and their applications, Approximating stationary points of stochastic mathematical programs with equilibrium constraints via sample averaging, Optimality conditions for disjunctive optimization in reflexive Banach spaces, On stability of M-stationary points in mpccs, Optimality conditions and exact penalty for mathematical programs with switching constraints, Low-Complexity Method for Hybrid MPC with Local Guarantees, Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs, The first-order necessary conditions for sparsity constrained optimization
Cites Work
