Quasiconvex minimization on a locally finite union of convex sets
From MaRDI portal
Publication:956610
DOI10.1007/s10957-008-9431-1zbMath1190.90130OpenAlexW1987426864MaRDI QIDQ956610
Publication date: 25 November 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9431-1
Related Items (5)
Quasimonotone quasivariational inequalities: existence results and applications ⋮ Semicontinuity of the solution map of quasivariational inequalities ⋮ Optimality conditions for disjunctive optimization in reflexive Banach spaces ⋮ Unnamed Item ⋮ Existence of time-dependent traffic equilibria
Cites Work
- Unnamed Item
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Projection, lifting and extended formulation integer and combinatorial optimization
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- A strong duality theorem for the minimum of a family of convex programs
- A note on duality in disjunctive programming
- Parametric disjunctive programming: One-sided differentiability of the value function
- Disjunctive optimization: Critical point theory
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- A local Steiner-type formula for general closed sets and applications
- Foundations of bilevel programming
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- A convex-analysis perspective on disjunctive cuts
- Quasiconvex programming with locally starshaped constraint region and applications to quasiconvex MPEC
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Adjusted Sublevel Sets, Normal Operator, and Quasi-convex Programming
This page was built for publication: Quasiconvex minimization on a locally finite union of convex sets
