Optimality conditions for disjunctive optimization in reflexive Banach spaces
From MaRDI portal
Publication:2260683
DOI10.1007/s10957-014-0571-1zbMath1307.90172OpenAlexW1981541597MaRDI QIDQ2260683
Publication date: 11 March 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0571-1
reflexive Banach spaceoptimality conditiondisjunctive optimizationMordukhovich normal coneconvex generalized polyhedron
Related Items (3)
Optimality conditions for sparse nonlinear programming ⋮ Scaled constraint qualifications for generalized equation constrained problems and application to nonsmooth mathematical programs with equilibrium constraints ⋮ The first-order necessary conditions for sparsity constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitzian stability of parametric variational inequalities over generalized polyhedra in Banach spaces
- Quasiconvex minimization on a locally finite union of convex sets
- Representability in mixed integer programming. I: Characterization results
- A strong duality theorem for the minimum of a family of convex programs
- Optimization with disjunctive constraints
- A note on duality in disjunctive programming
- Duality in disjunctive programming via vector optimization
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Parametric disjunctive programming: One-sided differentiability of the value function
- Convex programming for disjunctive convex optimization
- Unified approach to some geometric results in variational analysis
- Calmness of constraint systems with applications
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Calmness and Error Bounds for Convex Constraint Systems
- Optimization and nonsmooth analysis
- Polyhedral annexation in mixed integer and combinatorial programming
- Variational Analysis
- On the Calmness of a Class of Multifunctions
- On calculating the normal cone to a finite union of convex polyhedra†
- A subdifferential condition for calmness of multifunctions
This page was built for publication: Optimality conditions for disjunctive optimization in reflexive Banach spaces
