Invex optimization revisited
From MaRDI portal
Publication:2274856
DOI10.1007/s10898-018-0650-1zbMath1434.90149arXiv1707.01554OpenAlexW2963138777MaRDI QIDQ2274856
Ksenia Bestuzheva, Hassan Hijazi
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.01554
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- S-lemma with equality and its applications
- On constraint qualifications: motivation, design and inter-relations
- The essence of invexity
- Checking local optimality in constrained quadratic programming is NP- hard
- On sufficiency of the Kuhn-Tucker conditions
- B-vex functions
- What is invexity?
- Invex functions and constrained local minima
- On generalised convex mathematical programming
- Pseudo-Convex Functions
- \((p,r)\)-invex sets and functions